|
| |
|
|
A063271
|
|
Largest prime factor of 9^(2n)+1 (A063270).
|
|
2
| |
|
|
2, 41, 193, 6481, 21523361, 42521761, 769, 647753, 926510094425921, 282429005041, 128653413121, 56625998353, 24127552321, 37644053098601, 36214795668330833, 42521761, 1716841910146256242328924544641
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=0,...,50
|
|
|
PROG
| (PARI) for(n=0, 21, print(factor(9^(2*n)+1)))
(PARI) { for (n=0, 50, f=factor(9^(2*n) + 1)~; write("b063271.txt", n, " ", f[1, length(f)]) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 20 2009]
|
|
|
CROSSREFS
| Cf. A063270.
Sequence in context: A007533 A088565 A090195 * A142160 A174615 A109125
Adjacent sequences: A063268 A063269 A063270 * A063272 A063273 A063274
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Jason Earls (zevi_35711(AT)yahoo.com), Jul 12 2001
|
|
|
EXTENSIONS
| Definition corrected by Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 20 2009
|
| |
|
|
