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!)
A241860 Smallest integer m such that f(m) = 2^m + 3^m + 5^m + 7^m is divisible by 13^n. 1

%I #9 May 01 2014 03:40:19

%S 0,11,59,371,2399,134219,2190611,51201287,340809827,7117649663,

%T 105005336183,1504799253419,9776308764359,181823706591911,

%U 461400728061683,461400728061683,425698050383584895,3496851631229030315,91331844043408769327,506551808173712990111

%N Smallest integer m such that f(m) = 2^m + 3^m + 5^m + 7^m is divisible by 13^n.

%H Zak Seidov, <a href="/A241860/b241860.txt">Table of n, a(n) for n = 0..51</a>

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

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

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

%Y Cf. A241541.

%K nonn

%O 0,2

%A _Zak Seidov_, Apr 30 2014

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 14:46 EDT 2024. Contains 371749 sequences. (Running on oeis4.)