login
A095772
Number of times n appears in A093878.
0
2, 1, 2, 1, 2, 1, 2, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 4, 2, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 5, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 1, 1, 1, 1, 1, 6, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 5, 1, 1, 1, 1, 1, 1, 7, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
OFFSET
1,1
LINKS
FORMULA
a(A000045(n)-1) = n-4 for n>4.
PROG
(PARI) v=vector(1000, j, 1); for(n=3, 1000, g=v[v[v[n-1]]]+v[n-v[v[n-1]]]; v[n]=g); a(n)=sum(i=1, 3*n, if(v[i]-n, 0, 1))
CROSSREFS
Sequence in context: A193169 A193453 A227944 * A305392 A175301 A214074
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Jun 05 2004
STATUS
approved