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

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

1,6

EXAMPLE

n=6: GCD[64-1,36]=9=a(6)

CROSSREFS

Sequence in context: A078297 A113061 A176410 * A087968 A110483 A010164

Adjacent sequences:  A087963 A087964 A087965 * A087967 A087968 A087969

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 15 17:13 EST 2012. Contains 205828 sequences.