id:A060630 - OEIS Search Results

Search: id:A060630

Displaying 1-1 of 1 results found.

page 1

For n > 9 let f(n) be formed by writing down the sums of every pair of consecutive digits of n: e.g. f(3469)=71015 because 3+4=7,4+6=10,6+9=15; let f(n)=0 if n is a single digit. Sequence gives smallest number requiring n iterations to reach zero.

+0
2

0, 1, 10, 19, 109, 149, 197, 399, 694, 796, 893, 897, 1167, 1579, 1596, 1667, 1790, 1777, 2859, 1779, 1778, 1873, 3679, 5926, 11289, 9539, 13551, 4589, 5960, 12066, 12265, 19119, 10927, 12379, 11742, 65220, 34038, 40390, 1110025, 10100023 (list; graph; listen)

page 1

Search completed in 0.002 seconds

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.

AT&T Labs Research