A375119 - OEIS

%I #11 Aug 17 2024 23:14:37

%S 1,4,2,1,3,3,6,1,2,2,5,5,1,5,5,6,4,4,10,4,1,4,5,5,3,3,9,9,9,1,3,9,4,4,

%T 2,1,8,8,8,2,8,5,3,3,1,2,27,7,7,4,7,5,2,1,3,3,26,6,6,4,6,26,1,2,3,3,

%U 25,5,5,25,5,25,1,2,3,3,24,4,4,3,4,24,113

%N Begin A060403 with n instead of 1; a(n) is the position in the new sequence at which it generates the same numbers as A060403 or a(n)=0 if it doesn't.

%C The indices of the matching entries of A060403 and this sequence do not necessarily have to be the same (see Examples).

%H James C. McMahon, <a href="/A375119/b375119.txt">Table of n, a(n) for n = 1..1000</a>

%H Wikipedia,<a href="https://en.wikipedia.org/wiki/Kruskal_count">Kruskal count</a>

%e Using () to indicate the point at which the new sequence generates the same numbers as A060403:

%e A060403: 1, 4, 8, 13, 21, 30, 36, 45...	        a(1)=1

%e Start=2: 2, 6, 9, (13), 21, 30, 36, 45... 	a(2)=4

%e Start=3: 3, (8), 13, 21, 30, 36, 45...		a(3)=2

%e Start=4: (4), 8, 13, 21, 30, 36, 45...		a(4)=1

%t oneseq=NestList[#+Length[Select[Characters[IntegerName[#,"Words"]],LetterQ ]]&,1,200] (* oneseq is A060403 *);seq={};Do[ i=1;s=n;While[!MemberQ[oneseq,s],s=s+Length[Select[Characters[IntegerName[s,"Words"]],LetterQ ]];i++];AppendTo[seq,i],{n,83}];seq

%Y Cf. A060403.

%K nonn,base

%O 1,2

%A _James C. McMahon_, Jul 30 2024