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-3 of 3 results.

A277884 a(n) = A277814(A277826(n)).

Original entry on oeis.org

0, 1, 2, 3, 4, 1, 5, 6, 7, 8, 2, 6, 9, 1, 10, 11, 12, 13, 14, 6, 4, 8, 10, 15, 16, 13, 2, 11, 17, 1, 18, 19, 20, 21, 22, 6, 23, 13, 10, 3, 7, 1, 14, 15, 17, 8, 24, 25, 26, 27, 22, 11, 4, 13, 18, 25, 28, 21, 2, 19, 29, 1, 30, 31, 32, 33, 34, 6, 35, 21, 10, 25, 36, 37, 22, 3, 17, 13, 5, 15, 12, 38, 2, 15, 23, 1, 24, 39, 28, 37, 14, 25, 40, 8, 41
Offset: 0

Views

Author

Antti Karttunen, Nov 06 2016

Keywords

Crossrefs

Left inverse of A277817.
Cf. A277701, A277712, A277713, A277715 (positions of 1, 2, 3 and 8 in this sequence).
Cf. A277824, A277826 and their scatter-plots.

Programs

Formula

a(n) = A277814(A277826(n)).
Other identities. For all n >= 0:
a(A277817(n)) = n.

A277816 a(n) = the least k > n for which A264977(k) = A264977(n), or 0 if no such k exists.

Original entry on oeis.org

0, 5, 10, 39, 20, 13, 78, 11, 40, 21, 26, 19, 156, 29, 22, 27, 80, 25, 42, 35, 52, 45, 38, 43, 312, 37, 58, 51, 44, 41, 54, 59, 160, 57, 50, 67, 84, 53, 70, 75, 104, 61, 90, 79, 76, 93, 86, 55, 624, 101, 74, 99, 116, 77, 102, 71, 88, 69, 82, 115, 108, 85, 118, 123, 320, 121, 114, 131, 100, 117, 134, 91, 168, 89, 106, 147, 140, 109, 150, 83, 208, 105
Offset: 0

Views

Author

Antti Karttunen, Nov 06 2016

Keywords

Crossrefs

Cf. A277815 (a left inverse).
Cf. A277701, A277712, A277713, A277715 (iterates of this sequence starting from 1, 2, 3 and 9 respectively).

Programs

  • Scheme
    (define (A277816 n) (if (zero? n) n (let ((v (A264977 n))) (let loop ((k (+ 1 n))) (if (= v (A264977 k)) k (loop (+ 1 k)))))))

Formula

For all n >= 0, A277815(a(n)) = n.

A277824 a(0) = 0; for n >= 1, a(n) = 1 + a(A277815(n)); index of the column where n is located in array A277710.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Nov 06 2016

Keywords

Comments

For n >= 1, a(n) = index of the column where n is located in array A277710.
Ordinal transform of A277826 and A277884.

Crossrefs

Cf. A277817 (gives the positions of ones in this sequence).
Cf. A277826, A277884 and their scatter-plots.

Programs

Formula

a(0) = 0; for n >= 1, a(n) = 1 + a(A277815(n)).
Showing 1-3 of 3 results.