|
%I #23 Nov 21 2014 02:05:55
%S 2,2,2,2,3,3,2,2,3,4,3,3,3,2,2,3,4,4,2,3,4,3,3,4,3,5,5,5,5,4,4,4,6,4,
%T 5,5,5,6,5,4,6,6,5,4,5,6,7,6,5,5,4,5,5,6,3,5,6,5,6,5,6,3,6,7,5,5,4,5,
%U 5,5,6,4,7,4,4,6,6,4,5,7,3,3,3,4,3,5,2,3,5,5,6,7,6,4,7,5,6,5,7,3,8
%N a(n) = number of distinct primes obtained when inserting 1 anywhere in A069246(n).
%C Among the first 145 terms the largest is a(140)=9 because inserting 1 in 12 places into A069246(140)=18064911343, we get only 9 distinct primes (in the order of their appearances): 118064911343, 181064911343, 180164911343, 180614911343, 180641911343, 180649111343, 180649113143, 180649113413, 180649113431.
%H Zak Seidov, <a href="/A247069/b247069.txt">Table of n, a(n) for n = 1..145</a>
%e a(7)=2 because inserting 1 in 4 possible places into A069246(7)=151 we get only 2 distinct primes, 1151 and 1511.
%Y Cf. A069246.
%K nonn,base
%O 1,1
%A _Zak Seidov_, Nov 17 2014
|
