Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087968
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087968 a(n)=GCD[1+2^n,n^2]. +0
1
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; listen)
OFFSET

1,3

EXAMPLE

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

CROSSREFS

Sequence in context: A078297 A113061 A087966 this_sequence A110483 A010164 A006084

Adjacent sequences: A087965 A087966 A087967 this_sequence A087969 A087970 A087971

KEYWORD

nonn

AUTHOR

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

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research