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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088039 Smallest k such that k^3 == 1 (mod some n-th power), k > 1. 1
2, 4, 9, 17, 33, 65, 129, 257, 513, 1025, 2049, 4097, 8193, 16385, 32769, 65537, 131073, 262145, 524289, 1048577, 2097153, 4194305, 8388609, 16777217, 33554433, 67108865, 134217729, 268435457, 536870913, 1073741825, 2147483649 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

In most of the cases the n-th power that divides a(n)^3 is 2^n.

FORMULA

a(n) = A088038(n)^(1/3).

CROSSREFS

Cf. A088038.

Cf. A020737. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 11 2008]

Sequence in context: A192967 A182806 A007502 * A077931 A115451 A136326

Adjacent sequences:  A088036 A088037 A088038 * A088040 A088041 A088042

KEYWORD

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

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 16 14:37 EST 2012. Contains 205930 sequences.