login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088031 Smallest n-th power k such that k-1 is divisible by an n-th power. Smallest n-th power == 1 (mod some n-th power). 1
3, 9, 729, 81, 39135393, 887503681, 594467302491009, 852891037441, 2460686496619787545743873, 1213972926354344043087129601, 2672769719437237714909813214827010049, 1313734498399602126928988680233144321, 749477178512218249053016816019761862837541531656193 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
In order for the two descriptions to be equivalent, the n-th power cannot be 1 or the 2nd line cannot hold. - Ray Chandler, Oct 04 2003
LINKS
EXAMPLE
a(4) = 81 = 3^4 and 81-1 = 80 == 0 (mod 2^4).
CROSSREFS
Cf. A088032.
Sequence in context: A359615 A137036 A361389 * A069028 A318246 A137043
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Sep 19 2003
EXTENSIONS
More terms from Ray Chandler, Oct 04 2003
More terms from David Wasserman, Jun 21 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 01:40 EDT 2024. Contains 371696 sequences. (Running on oeis4.)