|
Search: id:A128682
|
|
|
| A128682 |
|
Numbers n such that n^3 divides 9^(n^2)+1. |
|
+0
12
|
| |
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
5 divides a(n) for n>1.
|
|
CROSSREFS
|
Cf. A127263 = numbers n such that n^3 divide 2^(n^2)+1. Cf. A128677 = Least k>p such that (kp)^3 divides (p-1)^(kp)^2+1, where p = Prime[n]>2. Cf. A128678, A128679, A128680, A128681, A128683, A128684, A128685.
Sequence in context: A124358 A114066 A083151 this_sequence A068234 A012741 A003394
Adjacent sequences: A128679 A128680 A128681 this_sequence A128683 A128684 A128685
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Mar 31 2007
|
|
|
Search completed in 0.002 seconds
|
