login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087968 a(n)=GCD[1+2^n,n^2]. 0
1, 1, 9, 1, 1, 1, 1, 1, 27, 25, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 81, 1, 1, 25, 1, 1, 9, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 27, 1, 1, 1, 1, 125, 9, 1, 1, 1, 121, 1, 9, 1, 1, 1, 1, 1, 27, 1, 1, 1, 1, 289, 9, 25, 1, 1, 1, 1, 9, 1, 1, 169, 1, 1, 243, 1, 1, 1, 1, 1, 9, 1, 1, 25, 1, 1, 9, 1, 1, 1 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

EXAMPLE

n=9: GCD[513,81]=27=a(9)

CROSSREFS

Sequence in context: A113061 A176410 A087966 * A110483 A010164 A006084

Adjacent sequences:  A087965 A087966 A087967 * A087969 A087970 A087971

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Sep 22 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 17:35 EST 2012. Contains 205644 sequences.