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.

A357361 Smallest number k such that A345112(k) = n.

This page as a plain text file.
%I A357361 #4 Sep 26 2022 20:21:27
%S A357361 1,5,19,118,89,123,102,145,104,777,1133,1012,858,942,651,150,453,132,
%T A357361 39,112551,39782,23244,81914,43810,40346
%N A357361 Smallest number k such that A345112(k) = n.
%o A357361 (PARI) eva(n) = subst(Pol(n), x, 10)
%o A357361 rot(vec) = if(#vec < 2, return(vec)); my(s=concat(Str(2), ".."), v=[]); s=concat(s, Str(#vec)); v=vecextract(vec, s); v=concat(v, vec[1]); v
%o A357361 a345112(n, bound) = my(x=n, i=0); while(1, x=x+eva(rot(digits(x))); i++; if(i > bound, return(-1), if(digits(x)==Vecrev(digits(x)), break))); i
%o A357361 a(n) = if(n==0, return(0)); for(k=1, oo, if(a345112(k, n)==n, return(k)))
%Y A357361 Cf. A345112.
%K A357361 nonn,base,more
%O A357361 1,2
%A A357361 _Felix Fröhlich_, Sep 25 2022