login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A270173 Smallest number k such that A270172(k) = n. 2

%I #11 Mar 16 2016 16:48:22

%S 0,90,80,70,60,50,40,30,20,10,100,190,180,170,160,150,140,130,120,

%T 1010,1200,1290,1280,1270,1260,1250,1240,1230,10120,12010,12300,12390,

%U 12380,12370,12360,12350,12340,101230,120120,123010,123400,123490,123480,123470

%N Smallest number k such that A270172(k) = n.

%o (PARI) eva(n) = subst(Pol(n), x, 10)

%o increasedigits(n) = my(d=digits(n)); for(k=1, #d, d[k]++; if(d[k]==10, d[k]=0)); eva(d)

%o a270172(n) = my(x=n, i=0); while(#Str(x) > 1, x=increasedigits(x); i++); i

%o a(n) = my(k=0); while(a270172(k)!=n, k++); k

%Y Cf. A269667, A270172.

%K nonn,base

%O 0,2

%A _Felix Fröhlich_, Mar 12 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 28 11:03 EDT 2024. Contains 372040 sequences. (Running on oeis4.)