Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063271
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063271 Largest factor of 9^(2n)+1, (A063270). +0
2
2, 41, 193, 6481, 21523361, 42521761, 769, 647753, 926510094425921, 282429005041, 128653413121, 56625998353, 24127552321, 37644053098601, 36214795668330833, 42521761, 1716841910146256242328924544641 (list; graph; listen)
OFFSET

0,1

PROGRAM

(PARI) for(n=0, 21, print(factor(9^(2*n)+1)))

CROSSREFS

Cf. A063270.

Sequence in context: A007533 A088565 A090195 this_sequence A142160 A109125 A065587

Adjacent sequences: A063268 A063269 A063270 this_sequence A063272 A063273 A063274

KEYWORD

easy,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jul 12 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 5 01:39 EDT 2008. Contains 143414 sequences.


AT&T Labs Research