login
a(n) = 10*(A256100(n+1)-1) + A007376(n+1), a simple variation of A065649.
4

%I #5 Aug 15 2015 12:10:14

%S 1,2,3,4,5,6,7,8,9,11,0,21,31,41,12,51,13,61,14,71,15,81,16,91,17,101,

%T 18,111,19,22,10,32,121,42,52,62,23,72,24,82,25,92,26,102,27,112,28,

%U 122,29,33,20,43,131,53,132,63,73,83,34,93,35,103,36,113,37

%N a(n) = 10*(A256100(n+1)-1) + A007376(n+1), a simple variation of A065649.

%C Permutation of the nonnegatve integers with inverse A261334.

%H Reinhard Zumkeller, <a href="/A261333/b261333.txt">Table of n, a(n) for n = 0..10000</a>

%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>

%o (Haskell)

%o a261333 n = a261333_list !! n

%o a261333_list = zipWith (+)

%o (map ((* 10) . subtract 1) a256100_list) a007376_list

%Y Cf. A256100, A007376, A261334 (inverse), A261335 (fixed points), A065649.

%K nonn,look

%O 0,2

%A _Reinhard Zumkeller_, Aug 15 2015