login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A241860 Smallest integer m such that f(m) = 2^m + 3^m + 5^m + 7^m is divisible by 13^n. 1
0, 11, 59, 371, 2399, 134219, 2190611, 51201287, 340809827, 7117649663, 105005336183, 1504799253419, 9776308764359, 181823706591911, 461400728061683, 461400728061683, 425698050383584895, 3496851631229030315, 91331844043408769327, 506551808173712990111 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Zak Seidov, Table of n, a(n) for n = 0..51

EXAMPLE

a(0) = 0 since f(0) = 4 is divisible by 13^0 = 1,

a(1) = 11 since f(11) = 2026334063 is divisible by 13^1 = 13,

a(2) = 59 since f(59) = 72574551707704256929436010920458549301938388467823 is divisible by 13^2 = 169.

CROSSREFS

Cf. A241541.

Sequence in context: A186256 A164299 A253207 * A082884 A193230 A077036

Adjacent sequences:  A241857 A241858 A241859 * A241861 A241862 A241863

KEYWORD

nonn

AUTHOR

Zak Seidov, Apr 30 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 5 07:46 EDT 2020. Contains 335462 sequences. (Running on oeis4.)