login
A095771
Number of times n appears in A095769.
2
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,1
LINKS
FORMULA
a(n) = card{ k in N : A095769(k)=n }.
PROG
(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))
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Jun 05 2004
STATUS
approved