The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A269667 a(n) = A270172(10*n). 2

%I

%S 0,9,8,7,6,5,4,3,2,1,10,9,18,17,16,15,14,13,12,11,10,9,8,17,16,15,14,

%T 13,12,11,10,9,8,7,16,15,14,13,12,11,10,9,8,7,6,15,14,13,12,11,10,9,8,

%U 7,6,5,14,13,12,11,10,9,8,7,6,5,4,13,12,11,10,9,8,7

%N a(n) = A270172(10*n).

%H Felix FrÃ¶hlich, <a href="/A269667/b269667.txt">Table of n, a(n) for n = 0..10000</a>

%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) = a270172(10*n)

%Y Cf. A270172, A270173.

%K nonn,base

%O 0,2

%A _Felix FrÃ¶hlich_, Mar 13 2016

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

Last modified September 19 22:06 EDT 2021. Contains 347576 sequences. (Running on oeis4.)