Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088032
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088032 Smallest number k such that k^n -1 is divisible by an n-th power. a(n) = A088031(n)^(1/n). +0
2
3, 3, 9, 3, 33, 31, 129, 31, 513, 511, 2049, 1023, 8193, 8191, 32769, 4095, 131073, 131071, 524289, 262143 (list; graph; listen)
OFFSET

1,1

COMMENT

For 2 < n < 18, if n is odd then a(n) = 2^n+1, and if n is even then a(n) = 2^(n-A007814(n))-1. - David Wasserman (wasserma(AT)spawar.navy.mil), Jun 21 2005

EXAMPLE

a(4) = 81 = 3^4 and 81-1 = 80 == 0 (mod 2^4).

CROSSREFS

Cf. A088031.

Adjacent sequences: A088029 A088030 A088031 this_sequence A088033 A088034 A088035

Sequence in context: A036553 A068219 A113213 this_sequence A066572 A104195 A062131

KEYWORD

more,nonn

AUTHOR

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

EXTENSIONS

Corrected and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 04 2003

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jun 21 2005

More terms from Ryan Propper (rpropper(AT)stanford.edu), Jul 21 2006

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 October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research