|
Search: id:A071568
|
|
|
| A071568 |
|
Smallest k>n such that n^3+1 divides k*n^2+1. |
|
+0
6
|
|
| 3, 11, 31, 69, 131, 223, 351, 521, 739, 1011, 1343, 1741, 2211, 2759, 3391, 4113, 4931, 5851, 6879, 8021, 9283, 10671, 12191, 13849, 15651, 17603, 19711, 21981, 24419, 27031, 29823, 32801, 35971, 39339, 42911, 46693, 50691, 54911, 59359
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
a(n)=n^3+n+1
|
|
PROGRAM
|
(PARI) for(n=1, 50, s=n+1; while((s*n^2+1)%(n^3+1)>0, s++); print1(s, ", "))
|
|
CROSSREFS
|
a(n+1) = A101220(n, n+1, 4).
Sequence in context: A018781 A119215 A057172 this_sequence A093406 A097081 A107587
Adjacent sequences: A071565 A071566 A071567 this_sequence A071569 A071570 A071571
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), May 31 2002
|
|
|
Search completed in 0.002 seconds
|
