|
|
A138261
|
|
Smallest positive integer m such that n divides [8^m/m] (=A129798(m)).
|
|
8
|
|
|
1, 1, 10, 1, 3, 10, 7, 1, 11, 3, 21, 11, 9, 9, 13, 2, 3, 11, 13, 9, 11, 21, 15, 11, 21, 9, 13, 9, 10, 13, 11, 2, 21, 3, 9, 11, 13, 13, 17, 9, 21, 11, 10, 21, 13, 15, 92, 55, 29, 21, 20, 9, 58, 13, 21, 9, 13, 10, 22, 13, 21, 11, 11, 4, 9, 21, 23, 9, 67, 9, 46, 11, 13, 13, 21, 13, 31, 17
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
This sequence is well-defined.
|
|
LINKS
|
Romanian Master in Mathematics Contest, Problem 3, Bucharest, 2007.
|
|
FORMULA
|
|
|
MATHEMATICA
|
spi[n_]:=Module[{m=1}, While[!Divisible[Floor[8^m/m], n], m++]; m]; Array[spi, 80] (* Harvey P. Dale, Oct 23 2022 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|