Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088037
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088037 Smallest square k == 1 (mod some n-th power), k > 1. +0
3
4, 9, 9, 49, 225, 961, 3969, 16129, 65025, 261121, 1046529, 4190209, 16769025, 67092481, 268402689, 1073676289, 4294836225, 17179607041, 68718952449, 274876858369, 1099509530625, 4398042316801, 17592177655809 (list; graph; listen)
OFFSET

1,1

COMMENT

From a(2) onwards the n-th power that divides a(n) -1 is 2^n ===> Second term onwards same as A060867 i.e. a(n+1) = (2^n-1)^2.

EXAMPLE

a(6) = 961 and 960 = 64*15.

CROSSREFS

Cf. A060867.

Sequence in context: A081949 A091657 A156047 this_sequence A071768 A161913 A020673

Adjacent sequences: A088034 A088035 A088036 this_sequence A088038 A088039 A088040

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 19 2003

EXTENSIONS

More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 04 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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research