|
Search: id:A136372
|
|
|
| A136372 |
|
a(n) = Prime factors of A127263(n) in order of their first occurence for n>1; a(1) = 1. |
|
+0
2
|
| |
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
A127263(1) = 1,
A127263(2) = 3,
A127263(3) = 57 = 3*19,
A127263(4) = 32547 = 3*19*571,
A127263(5) = 9961491 = 3*19*174763,
A127263(6) = 297381939 = 3*19*571*9137.
Thus a(1) = 1, a(2) = 3, a(3) = 19, a(4) = 571, a(5) = 174763, a(6) = 9137.
|
|
CROSSREFS
|
Cf. A127263 = Numbers n such that n^3 divide 2^(n^2)+1. Cf. A128677, A128678, A128679, A128680, A128681, A128682, A128683, A128684, A128685. Cf. A136373.
Sequence in context: A079281 A079306 A051381 this_sequence A107706 A114301 A098796
Adjacent sequences: A136369 A136370 A136371 this_sequence A136373 A136374 A136375
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Dec 27 2007
|
|
|
Search completed in 0.002 seconds
|
