A031076 Write n in base 9 and juxtapose.
1, 2, 3, 4, 5, 6, 7, 8, 1, 0, 1, 1, 1, 2, 1, 3, 1, 4, 1, 5, 1, 6, 1, 7, 1, 8, 2, 0, 2, 1, 2, 2, 2, 3, 2, 4, 2, 5, 2, 6, 2, 7, 2, 8, 3, 0, 3, 1, 3, 2, 3, 3, 3, 4, 3, 5, 3, 6, 3, 7, 3, 8, 4, 0, 4, 1, 4, 2, 4, 3, 4, 4, 4, 5, 4, 6, 4, 7, 4, 8, 5, 0, 5, 1, 5, 2, 5, 3, 5, 4
Offset: 1
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Crossrefs
Programs
-
Haskell
a031076 n = a031076_list !! (n-1) a031076_list = concat $ map reverse $ tail a031087_tabf -- Reinhard Zumkeller, Jul 07 2015
-
Magma
&cat[Reverse(IntegerToSequence(n,9)):n in[1..31]]; // Jason Kimberley, Dec 07 2012
-
Mathematica
Flatten@ IntegerDigits[ Range@ 55, 9] (* or *) almostNatural[n_, b_] := Block[{m = 0, d = n, i = 1, l, p}, While[m <= d, l = m; m = (b - 1) i*b^(i - 1) + l; i++]; i--; p = Mod[d - l, i]; q = Floor[(d - l)/i] + b^(i - 1); If[p != 0, IntegerDigits[q, b][[p]], Mod[q - 1, b]]]; Array[ almostNatural[#, 9] &, 105] (* Robert G. Wilson v, Jul 01 2014 *)
-
Python
from itertools import count, chain, islice from sympy.ntheory.factor_ import digits def A031076_gen(): return chain.from_iterable(digits(m,9)[1:] for m in count(1)) A031076_list = list(islice(A031076_gen(),30)) # Chai Wah Wu, Jan 07 2022
Comments