A355549 Number of positive integers k with 1 < k < n such that n occurs in the Reverse-and-Multiply trajectory of k.
0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0
Offset: 0
Crossrefs
Cf. A355550.
Programs
-
PARI
revmult(n) = n*eval(concat(Vecrev(Str(n)))) a(n) = my(i=0); for(k=2, n-1, my(x=k); while(x < n, if(x==revmult(x), break, x=revmult(x))); if(x==n, i++)); i