cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A355548 a(n) is the smallest number k such that k occurs in the Reverse-and-Add trajectories of exactly n positive integers less than k.

Original entry on oeis.org

0, 2, 4, 8, 16, 33, 55, 404, 44, 646, 99, 66, 848, 909, 888, 110, 88, 1090, 132, 176, 1089, 363, 3443, 10010, 121, 1881, 242, 1991, 4323, 3982, 1595, 726, 3553, 2992, 3663, 7447, 484, 1353, 46064, 6446, 5665, 10769, 3993, 2662, 4103, 2882, 968, 1111, 1837, 7667
Offset: 0

Views

Author

Felix Fröhlich, Jul 06 2022

Keywords

Comments

a(n) is the smallest k such that A298972(k) = n.

Crossrefs

Programs

  • PARI
    a298972(n) = my(i=0); for(k=1, n-1, my(x=k); while(x < n, x=x+eval(concat(Vecrev(Str(x))))); if(x==n, i++)); i
    a(n) = for(k=0, oo, if(a298972(k)==n, return(k)))

Extensions

More terms from Jinyuan Wang, Jul 07 2022

A355549 Number of positive integers k with 1 < k < n such that n occurs in the Reverse-and-Multiply trajectory of k.

Original entry on oeis.org

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

Views

Author

Felix Fröhlich, Jul 06 2022

Keywords

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
Showing 1-2 of 2 results.