cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A241860 #9 May 01 2014 03:40:19
%S A241860 0,11,59,371,2399,134219,2190611,51201287,340809827,7117649663,
%T A241860 105005336183,1504799253419,9776308764359,181823706591911,
%U A241860 461400728061683,461400728061683,425698050383584895,3496851631229030315,91331844043408769327,506551808173712990111
%N A241860 Smallest integer m such that f(m) = 2^m + 3^m + 5^m + 7^m is divisible by 13^n.
%H A241860 Zak Seidov, <a href="/A241860/b241860.txt">Table of n, a(n) for n = 0..51</a>
%e A241860 a(0) = 0 since f(0) = 4 is divisible by 13^0 = 1,
%e A241860 a(1) = 11 since f(11) = 2026334063 is divisible by 13^1 = 13,
%e A241860 a(2) = 59 since f(59) = 72574551707704256929436010920458549301938388467823 is divisible by 13^2 = 169.
%Y A241860 Cf. A241541.
%K A241860 nonn
%O A241860 0,2
%A A241860 _Zak Seidov_, Apr 30 2014