A375119 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.

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, 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, 25, 5, 5, 25, 5, 25, 1, 2, 3, 3, 24, 4, 4, 3, 4, 24, 113

Offset: 1

Author

James C. McMahon, Jul 30 2024

Keywords

• nonn
• base

Comments

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

Examples

			Using () to indicate the point at which the new sequence generates the same numbers as A060403:
  A060403: 1, 4, 8, 13, 21, 30, 36, 45...      a(1)=1
  Start=2: 2, 6, 9, (13), 21, 30, 36, 45...    a(2)=4
  Start=3: 3, (8), 13, 21, 30, 36, 45...       a(3)=2
  Start=4: (4), 8, 13, 21, 30, 36, 45...       a(4)=1
		

Links

• James C. McMahon, Table of n, a(n) for n = 1..1000
• Wikipedia,Kruskal count

Crossrefs

Cf. A060403.

Programs

Mathematica

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