|
Search: id:A088040
|
|
|
| A088040 |
|
Smallest fourth power k such that k-1 is divisible by an n-th power, k > 1. |
|
+0
2
|
|
| 16, 81, 81, 81, 2401, 50625, 923521, 15752961, 260144641, 4228250625, 68184176641, 1095222947841, 17557851463681, 281200199450625, 4501401006735361, 72040003462430721, 1152780773560811521
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(2)=a(3)=a(4) as every odd fourth power is == 1 mod (2^4).
|
|
EXAMPLE
|
a(5) = 2401 = 7^4 and 7^4 -1 = (2^5)*3*5^2.
a(6) = 50625 = 15^4 and 15^4 -1 = (2^6)*7*113.
|
|
CROSSREFS
|
Cf. A088041.
Sequence in context: A056553 A053167 A110892 this_sequence A065771 A041490 A096020
Adjacent sequences: A088037 A088038 A088039 this_sequence A088041 A088042 A088043
|
|
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
|
|
|
Search completed in 0.002 seconds
|
