login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275993 Champernowne sequence: write n in base 16 and juxtapose. 0

%I #14 Sep 20 2016 13:33:37

%S 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1,0,1,1,1,2,1,3,1,4,1,5,1,6,1,

%T 7,1,8,1,9,1,10,1,11,1,12,1,13,1,14,1,15,2,0,2,1,2,2,2,3,2,4,2,5,2,6,

%U 2,7,2,8,2,9,2,10,2,11,2,12,2,13,2,14,2,15,3,0,3,1,3,2,3,3,3,4,3,5,3,6,3,7,3,8,3,9,3,10,3,11,3

%N Champernowne sequence: write n in base 16 and juxtapose.

%C 10 -> A, 11 -> B, 12 -> C, 13 -> D, 14 -> E & 15 -> F.

%H Jim Bumgardner, <a href="http://krazydad.com/hexsudoku/">Hexadecimal Sudoku Puzzles</a>

%H Tech Insider, <a href="http://www.techinsider.io/the-martian-hexidecimal-language-2015-9">This is the code Matt Damon and NASA use to communicate in 'The Martian'</a>

%H Eric W. Weisstein, Wolfram MathWorld, <a href="http://mathworld.wolfram.com/Hexadecimal.html">Hexadecimal</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Hexadecimal">Hexadecimal</a>

%t 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[#, 16] &, 105, 0]

%Y 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), A030548 (b=6), A030998 (b=7), A031035 and A054634 (b=8), A031076 (b=9), A007376 and A033307 (b=10).

%K nonn,base

%O 0,3

%A _Robert G. Wilson v_, Aug 15 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 19:52 EDT 2024. Contains 371963 sequences. (Running on oeis4.)