|
Search: id:A128678
|
|
|
| A128678 |
|
Numbers n such that n^3 divides 4^(n^2)+1. |
|
+0
13
|
|
| 1, 5, 205, 505, 20705, 40505, 168305, 408545, 1342505, 1660705, 2084645, 4091005, 10201505, 16322105, 16750345, 16998805, 37217545, 49985405, 55042705, 117165905, 135593005, 167731205, 186678805, 210549145, 218301905, 418261705
(list; graph; listen)
|
|
|
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. A128679, A128680, A128681, A128682, A128683, A128684, A128685.
Sequence in context: A070906 A137736 A157389 this_sequence A012811 A060486 A002438
Adjacent sequences: A128675 A128676 A128677 this_sequence A128679 A128680 A128681
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Mar 31 2007
|
|
EXTENSIONS
|
More terms from Ryan Propper (rpropper(AT)cs.stanford.edu), Jan 13 2008
|
|
|
Search completed in 0.005 seconds
|
