Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088039
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088039 Smallest k such that k^3 == 1 (mod some n-th power), k > 1. +0
2
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; listen)
OFFSET

1,1

COMMENT

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.

Adjacent sequences: A088036 A088037 A088038 this_sequence A088040 A088041 A088042

Sequence in context: A136379 A065026 A007502 this_sequence A115451 A077931 A136326

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

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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research