A032762 Take list of integers n >= 0, move left digit of each term to end of previous term.
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 1, 11, 21, 31, 41, 51, 61, 71, 81, 92, 2, 12, 22, 32, 42, 52, 62, 72, 82, 93, 3, 13, 23, 33, 43, 53, 63, 73, 83, 94, 4, 14, 24, 34, 44, 54, 64, 74, 84, 95, 5, 15, 25, 35, 45, 55, 65, 75, 85, 96, 6, 16, 26, 36, 46, 56, 66, 76, 86, 97, 7, 17, 27
Offset: 0
Examples
...,15,16,17,18,19,... -> ...,51,61,71,81,...
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
Programs
-
Haskell
a032762 n = a032762_list !! n a032762_list = 0 : map read (zipWith (++) vs (tail us)) :: [Integer] where (us,vs) = unzip $ map ((splitAt 1) . show) [0..] -- Reinhard Zumkeller, Oct 10 2013