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!)
 A249873 In decimal representation: replace each even positioned digit with the digit sum of its double. 3
 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 30, 31, 32, 33, 34, 35, 36 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 PROG (Haskell) a249873 n = if n == 0 then 0 else 100*a249873 n' + 10*a007953 (2*t) + d             where (n', td) = divMod n 100; (t, d) = divMod td 10 CROSSREFS Cf. A007953, A093017, A028897. Sequence in context: A180083 A275775 A217556 * A102491 A111706 A118761 Adjacent sequences:  A249870 A249871 A249872 * A249874 A249875 A249876 KEYWORD nonn,base AUTHOR Reinhard Zumkeller, Nov 08 2014 STATUS approved

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 February 22 23:44 EST 2020. Contains 332157 sequences. (Running on oeis4.)