Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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


AT&T Labs Research