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.

Showing 1-2 of 2 results.

A307667 Lexicographically earliest sequence of positive terms, such that each value, say v, appears four times at indices k, k + v, k + 2*v and k + 3*v for some k.

Original entry on oeis.org

1, 1, 1, 1, 2, 4, 2, 7, 2, 4, 2, 8, 6, 4, 7, 11, 9, 4, 6, 8, 12, 7, 14, 15, 6, 9, 11, 8, 7, 10, 6, 16, 12, 18, 9, 8, 14, 11, 15, 10, 17, 13, 20, 9, 12, 25, 19, 16, 11, 10, 14, 18, 3, 15, 13, 3, 12, 17, 3, 10, 23, 3, 20, 16, 14, 19, 5, 13, 15, 18, 25, 5, 21, 24
Offset: 1

Views

Author

Rémy Sigrist, Apr 20 2019

Keywords

Comments

This sequence is a variant of A307664.
Graphically, we have four wavy lines.
Apparently every positive integer appears in the sequence.

Examples

			For n = 1:
- we can set a(1) = a(2) = a(3) = a(4) = 1.
For n = 5:
- we can set a(5) = a(7) = a(9) = a(11) = 2.
For n = 6:
- a(9) is already known, hence a(6) <> 3,
- we can set a(6) = a(10) = a(14) = a(18) = 4.
		

Crossrefs

Programs

  • PARI
    See Links section.

A307669 Lexicographically earliest sequence of positive terms, such that each value, say v, appears five times at indices k, k + v, k + 2*v, k + 3*v and k + 4*v for some k.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 4, 2, 8, 2, 4, 2, 9, 2, 4, 10, 8, 3, 4, 14, 3, 9, 4, 3, 8, 10, 3, 11, 13, 3, 9, 19, 8, 14, 12, 10, 15, 20, 11, 9, 8, 13, 17, 21, 24, 10, 12, 14, 9, 11, 19, 15, 26, 30, 13, 10, 23, 20, 12, 17, 11, 14, 25, 28, 21, 29, 15, 13, 24, 19, 12, 11, 18
Offset: 1

Views

Author

Rémy Sigrist, Apr 20 2019

Keywords

Comments

This sequence is a variant of A307664.
Graphically, we have five chaotic lines.
Apparently every positive integer appears in the sequence.

Examples

			For n = 1:
- we can set a(1) = a(2) = a(3) = a(4) = a(5) = 1.
For n = 6:
- we can set a(6) = a(8) = a(10) = a(12) = a(14) = 2.
For n = 7:
- a(10) is already known, hence a(7) <> 3,
- we can set a(7) = a(11) = a(15) = a(19) = a(23) = 4.
		

Crossrefs

Programs

  • PARI
    See Links section.
Showing 1-2 of 2 results.