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.

Previous Showing 11-14 of 14 results.

A244683 The spiral of Champernowne read by the Northwest ray.

Original entry on oeis.org

1, 5, 3, 3, 7, 5, 7, 0, 2, 1, 7, 9, 2, 6, 9, 3, 7, 2, 4, 1, 7, 6, 8, 4, 8, 7, 3, 6, 1, 8, 7, 8, 1, 6, 3, 2, 3, 6, 1, 8, 7, 8, 1, 6, 3, 2, 3, 6, 1, 8, 7, 8, 1, 6, 3, 2, 3, 6, 1, 8, 7, 8, 1, 6, 3, 2, 3, 6, 1, 8, 7, 8, 1, 6, 3, 2, 3, 6, 1, 8, 7, 8, 1, 6, 3, 2, 3, 6, 1, 8, 7, 8, 1, 6, 3, 2, 3, 6, 1, 1, 0, 1, 5, 7, 1
Offset: 1

Views

Author

Robert G. Wilson v, Jul 04 2014

Keywords

Examples

			See A244677 for the spiral of David Gawen Champernowne.

Crossrefs

Cf. A033307, A053755, A033952, A244677-A244688, A244690-A244692.

Programs

  • Mathematica
    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]]]; f[n_] := 4n^2 - 8n + 5 (* see A244677 formula section *); Array[ almostNatural[ f@#, 10] &, 105]

Formula

See A244677 formula section.

A244684 The spiral of Champernowne read by the West-Northwest ray.

Original entry on oeis.org

1, 1, 8, 7, 3, 1, 2, 0, 3, 4, 3, 6, 8, 2, 0, 8, 5, 1, 5, 2, 2, 2, 2, 9, 7, 2, 9, 0, 0, 3, 8, 2, 1, 4, 9, 8, 0, 5, 0, 7, 7, 7, 3, 8, 2, 8, 7, 2, 5, 9, 0, 5, 8, 2, 1, 1, 6, 6, 9, 3, 3, 4, 5, 3, 5, 5, 7, 6, 3, 7, 7, 6, 8, 8, 9, 0, 2, 2, 0, 2, 2, 3, 7, 8, 4, 5, 0, 4, 2, 7, 8, 3, 3, 1, 0, 1, 3, 3, 7, 3, 4, 8, 5, 9, 6
Offset: 1

Views

Author

Robert G. Wilson v, Jul 04 2014

Keywords

Examples

			See A244677 for the spiral of David Gawen Champernowne.

Crossrefs

Cf. A033307, A143859, A033952, A244677-A244688, A244690-A244692.

Programs

  • Mathematica
    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]]]; f[n_] := 16n^2 - 31n + 16 (* see A244677 formula section *); Array[ almostNatural[ f@#, 10] &, 105]

Formula

See A244677 formula section.

A244685 The spiral of Champernowne read by the West ray.

Original entry on oeis.org

1, 6, 4, 2, 9, 5, 0, 4, 1, 1, 3, 2, 2, 6, 3, 3, 3, 4, 4, 4, 5, 6, 9, 7, 8, 8, 9, 1, 8, 1, 1, 4, 9, 1, 4, 1, 2, 1, 7, 0, 7, 1, 0, 3, 4, 2, 4, 9, 3, 2, 7, 9, 4, 3, 2, 1, 7, 3, 6, 7, 2, 4, 1, 6, 9, 4, 6, 8, 8, 5, 1, 3, 9, 5, 7, 2, 2, 6, 3, 3, 7, 6, 0, 8, 4, 7, 6, 6, 3, 8, 4, 8, 4, 8, 1, 2, 7, 9, 9, 2, 0, 0, 5, 1, 5
Offset: 1

Views

Author

Robert G. Wilson v, Jul 04 2014

Keywords

Examples

			See A244677 for the spiral of David Gawen Champernowne.

Crossrefs

Cf. A033307, A054567, A033952, A244677-A244688, A244690-A244692.

Programs

  • Mathematica
    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]]]; f[n_] := 4n^2 - 7n + 4 (* see A244677 formula section *); Array[ almostNatural[ f@#, 10] &, 105]

Formula

See A244677 formula section.

A244686 The spiral of Champernowne read by the West-Southwest ray.

Original entry on oeis.org

1, 1, 0, 8, 2, 7, 2, 0, 8, 4, 8, 9, 8, 5, 0, 1, 3, 4, 5, 1, 2, 5, 2, 2, 9, 9, 0, 3, 4, 6, 9, 4, 7, 5, 9, 5, 8, 8, 0, 6, 7, 3, 3, 7, 4, 1, 7, 9, 9, 1, 0, 1, 0, 2, 5, 1, 1, 2, 1, 6, 3, 1, 4, 0, 7, 5, 1, 6, 9, 8, 7, 1, 8, 8, 9, 0, 2, 1, 7, 0, 2, 2, 3, 6, 1, 5, 2, 6, 5, 2, 8, 2, 9, 4, 3, 1, 3, 2, 3, 4, 4, 3, 5, 2, 5
Offset: 1

Views

Author

Robert G. Wilson v, Jul 04 2014

Keywords

Examples

			See A244677 for the spiral of David Gawen Champernowne.

Crossrefs

Cf. A033307, A143854, A033952, A244677-A244688, A244690-A244692.

Programs

  • Mathematica
    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]]]; f[n_] := 16n^2 - 29n + 14 (* see A244677 formula section *); Array[ almostNatural[ f@#, 10] &, 105]

Formula

See A244677 formula section.
Previous Showing 11-14 of 14 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.