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.

A277817 Positions of zeros in A277815; sequence A277711 sorted into ascending order.

Original entry on oeis.org

0, 1, 2, 3, 4, 6, 7, 8, 9, 12, 14, 15, 16, 17, 18, 23, 24, 28, 30, 31, 32, 33, 34, 36, 46, 47, 48, 49, 56, 60, 62, 63, 64, 65, 66, 68, 72, 73, 81, 87, 92, 94, 95, 96, 97, 98, 111, 112, 120, 124, 126, 127, 128, 129, 130, 132, 135, 136, 137, 143, 144, 145, 146, 153, 159, 162, 174, 175, 177, 184, 188, 190, 191, 192, 193, 194, 196, 222
Offset: 0

Views

Author

Antti Karttunen, Nov 06 2016

Keywords

Comments

Numbers n for which there is no such k < n that A264977(k) = A264977(n).
After zero, numbers not in the range of A277816.

Links

Crossrefs

Cf. A264977, A277696, A277815, A277816.
Sequence A277711 sorted into ascending order.
Positions of ones in A277824.
Cf. A277884 (a left inverse).

Formula

Other identities. For all n >= 0:
A277884(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.

Links

Crossrefs

Cf. A277815, A277710.
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)).

A277826 a(n) = the least k for which A264977(k) = A264977(n).

Original entry on oeis.org

0, 1, 2, 3, 4, 1, 6, 7, 8, 9, 2, 7, 12, 1, 14, 15, 16, 17, 18, 7, 4, 9, 14, 23, 24, 17, 2, 15, 28, 1, 30, 31, 32, 33, 34, 7, 36, 17, 14, 3, 8, 1, 18, 23, 28, 9, 46, 47, 48, 49, 34, 15, 4, 17, 30, 47, 56, 33, 2, 31, 60, 1, 62, 63, 64, 65, 66, 7, 68, 33, 14, 47, 72, 73, 34, 3, 28, 17, 6, 23, 16, 81, 2, 23, 36, 1, 46, 87, 56, 73, 18, 47, 92, 9
Offset: 0

Views

Author

Antti Karttunen, Nov 06 2016

Keywords

Links

Crossrefs

Cf. A264977, A277816.
Cf. A277701, A277712, A277713, A277715 (positions of 1, 2, 3 and 9 in this sequence).
Cf. A277824, A277884 and their scatter-plots.

Programs

  • Scheme
    (define (A277826 n) (let ((v (A264977 n))) (let loop ((k 0)) (if (= v (A264977 k)) k (loop (+ 1 k))))))
Showing 1-3 of 3 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.