A030548 Write n in base 6 and juxtapose.
1, 2, 3, 4, 5, 1, 0, 1, 1, 1, 2, 1, 3, 1, 4, 1, 5, 2, 0, 2, 1, 2, 2, 2, 3, 2, 4, 2, 5, 3, 0, 3, 1, 3, 2, 3, 3, 3, 4, 3, 5, 4, 0, 4, 1, 4, 2, 4, 3, 4, 4, 4, 5, 5, 0, 5, 1, 5, 2, 5, 3, 5, 4, 5, 5, 1, 0, 0, 1, 0, 1, 1, 0, 2, 1, 0, 3, 1, 0, 4, 1, 0, 5, 1, 1, 0, 1, 1, 1, 1
Offset: 1
Links
- R. J. Mathar, Table of n, a(n) for n = 1..5950
Crossrefs
Tables in which the n-th row lists the base b digits of n: A030190 and A030302 (b=2), A003137 and A054635 (b=3), A030373 (b=4), A031219 (b=5), this sequence (b=6), A030998 (b=7), A031035 and A054634 (b=8), A031076 (b=9), A007376 and A033307 (b=10). - Jason Kimberley, Dec 06 2012
Cf. A030567 for the same table with reversed rows.
Programs
-
Magma
&cat[Reverse(IntegerToSequence(n,6)):n in[1..31]]; // Jason Kimberley, Dec 07 2012
-
Mathematica
Flatten@ IntegerDigits[ Range@ 50, 6] (* 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[ a[#, 6] &, 105] (* Robert G. Wilson v, Jul 01 2014 *)
-
Python
from itertools import count, chain, islice from sympy.ntheory.factor_ import digits def A030548_gen(): return chain.from_iterable(digits(m, 6)[1:] for m in count(1)) A030548_list = list(islice(A030548_gen(), 30)) # Chai Wah Wu, Jan 07 2022
Extensions
Edited by N. J. A. Sloane at the suggestion of Andrew S. Plewe, Aug 23 2007
Comments