A095771 Number of times n appears in A095769.

2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 3, 1, 2, 1, 1, 1, 1, 1, 1, 4, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 5, 1, 2, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

Offset: 1

Author

Benoit Cloitre, Jun 05 2004

Keywords

• nonn

Links

• J. Grytczuk, Another variation on Conway's recursive sequence, Discr. Math. 282 (2004), 149-161.

Crossrefs

Cf. A004001, A093878, A095769, A095770, A051135.

Programs

PARI

v=vector(1000,j,1);for(n=3,1000,g=v[v[v[v[n-1]]]]+v[n-v[v[v[n-1]]]];v[n]=g);a(n)=sum(i=1,3*n,if(v[i]-n,0,1))

Formula

a(n) = card{ k in N : A095769(k)=n }.