cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A121019 Value of n written in Braille, seen as 2 X 3 bit-code: 1 for a raised dot and 0 for an empty dot position.

Original entry on oeis.org

22, 32, 48, 36, 38, 34, 52, 54, 50, 20, 2070, 2080, 2096, 2084, 2086, 2082, 2100, 2102, 2098, 2068, 3094, 3104, 3120, 3108, 3110, 3106, 3124, 3126, 3122, 3092, 2326, 2336, 2352, 2340, 2342, 2338, 2356, 2358, 2354, 2324, 2454, 2464, 2480, 2468, 2470, 2466
Offset: 0

Views

Author

Reinhard Zumkeller, Jul 23 2006

Keywords

Comments

A000120(a(n)) = A079399(n).

Examples

			...... +-----+
n=0: . | _ . | -> (010)(110)
...... | . . | .. -> 010110[bin] = 22 = a(0)
...... | _ _ |
...... +-----+
n=1: . | . _ | -> (100)(000)
...... | _ _ | .. -> 100000[bin] = 32 = a(1)
...... | _ _ |
...... +-----+
n=2: . | . _ | -> (110)(000)
...... | . _ | .. -> 110000[bin] = 48 = a(2)
...... | _ _ |
...... +-----+
n=3: . | . . | -> (100)(100)
...... | _ _ | .. -> 100100[bin] = 36 = a(3)
...... | _ _ |
...... +-----+
n=4: . | . . | -> (100)(110)
...... | _ . | .. -> 100110[bin] = 38 = a(4)
...... | _ _ |
...... +-----+
n=5: . | . _ | -> (100)(010)
...... | _ . | .. -> 100100[bin] = 34 = a(5)
...... | _ _ |
...... +-----+
n=6: . | . . | -> (110)(100)
...... | . _ | .. -> 111000[bin] = 52 = a(6)
...... | _ _ |
...... +-----+
n=7: . | . . | -> (110)(110)
...... | . . | .. -> 110110[bin] = 54 = a(7)
...... | _ _ |
...... +-----+
n=8: . | . _ | -> (110)(010)
...... | . . | .. -> 101100[bin] = 50 = a(8)
...... | _ _ |
...... +-----+
n=9: . | _ . | -> (010)(100)
...... | . _ | .. -> 010100[bin] = 20 = a(9)
...... | _ _ |
...... +-----+.
		

Crossrefs

Cf. A121018.

Programs

  • Mathematica
    a[0]=22; a[1]= 32; a[2]= 48; a[3]= 36; a[4]= 38; a[5]= 34; a[6]= 52; a[7]= 54; a[8]= 50; a[9]=20; a[n_]:=a[Floor[n/10]]*64+a[Mod[n, 10]]; Table[a[n], {n, 0, 45}] (* James C. McMahon, Oct 12 2024 *)

Formula

a(n) = a(floor(n/10))*64 + a(n mod 10) for n>9.