A032763 Take list of even numbers, move left digit of each term to end of previous term.
0, 2, 4, 6, 8, 1, 1, 21, 41, 61, 82, 2, 22, 42, 62, 83, 3, 23, 43, 63, 84, 4, 24, 44, 64, 85, 5, 25, 45, 65, 86, 6, 26, 46, 66, 87, 7, 27, 47, 67, 88, 8, 28, 48, 68, 89, 9, 29, 49, 69, 81, 1, 21, 41, 61, 81, 101, 121, 141, 161, 181, 201, 221, 241, 261, 281, 301, 321, 341
Offset: 0
Examples
Here is how the first few terms are obtained: from 0 2 4 6 8 10 12 14 16 ... we get 0/ 2/ 4/ 6/ 8/ 1/0 1/2 1/4 1/6 ... hence 0,2,4,6,8,1,1,21,41,61,...
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
Programs
-
Haskell
a032763 n = a032763_list !! n a032763_list = 0 : map read (zipWith (++) vs (tail us)) :: [Integer] where (us,vs) = unzip $ map ((splitAt 1) . show) [0, 2 ..] -- Reinhard Zumkeller, Oct 10 2013