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

A100919 Index of the first occurrence of n in A100798.

Original entry on oeis.org

1, 2, 3, 4, 6, 8, 10, 13, 16, 17, 21, 25, 27, 34, 35, 40, 47, 55, 56, 63, 71, 73, 86, 90, 103, 104, 105, 125, 126, 141, 152, 153, 171, 177, 180, 181, 210, 211, 237, 241, 242, 261, 262, 281, 313, 317, 339, 345, 362, 397, 398, 421, 437, 438, 469, 484, 485, 486, 488
Offset: 1

Views

Author

Ray Chandler, Dec 08 2004

Keywords

Crossrefs

Cf. A100798, A100920.

A100920 Index of the last occurrence of n in A100798.

Original entry on oeis.org

1, 5, 11, 19, 30, 43, 61, 77, 99, 120, 145, 172, 206, 233, 263, 302, 346, 386, 428, 477, 517, 568, 631, 675, 744, 794, 863, 926, 989, 1057, 1142, 1210, 1275, 1357, 1444, 1531, 1608, 1687, 1782, 1871, 1943, 2056, 2140, 2253, 2367, 2467, 2596, 2708, 2814
Offset: 1

Views

Author

Ray Chandler, Dec 08 2004

Keywords

Crossrefs

Cf. A100798, A100919.

A100795 n occurs n times, as early as possible subject to the constraint that no two successive terms are identical.

Original entry on oeis.org

1, 2, 3, 2, 3, 4, 3, 4, 5, 4, 5, 4, 5, 6, 5, 6, 5, 6, 7, 6, 7, 6, 7, 6, 7, 8, 7, 8, 7, 8, 7, 8, 9, 8, 9, 8, 9, 8, 9, 8, 9, 10, 9, 10, 9, 10, 9, 10, 9, 10, 11, 10, 11, 10, 11, 10, 11, 10, 11, 10, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 13, 12, 13, 12, 13, 12, 13, 12, 13, 12, 13, 12
Offset: 1

Views

Author

Amarnath Murthy, Dec 05 2004

Keywords

Comments

Permutation of A002024. - Reinhard Zumkeller, Jan 17 2014

Examples

			After a(8) = 4 the next term is 5 as 3 has already occurred three times.

Links

Crossrefs

Cf. A061925, A074148, A100798.

Programs

  • Haskell
    a100795 n = a100795_list !! (n-1)
a100795_list = f 0 a002024_list where
   f x ws = v : f v (us ++ vs) where (us, v:vs) = span (== x) ws
-- Reinhard Zumkeller, Jan 17 2014

Extensions

Corrected and extended by Ray Chandler, Dec 08 2004

A161759 n occurs n times, as early as possible subject to the constraint that two successive occurrences of n are separated by exactly n terms.

Original entry on oeis.org

1, 2, 3, 4, 2, 5, 3, 6, 4, 14, 3, 5, 19, 4, 6, 21, 9, 5, 4, 40, 54, 6, 79, 5, 14, 7, 9, 69, 6, 5, 146, 74, 19, 7, 89, 6, 9, 21, 29, 14, 164, 7, 6, 99, 104, 230, 9, 188, 209, 7, 335, 529, 19, 139, 14, 329, 9, 7, 149, 21, 40, 750, 559, 174, 44, 7, 9, 349, 29, 14, 999, 1273, 19, 7
Offset: 1

Views

Author

Martins Opmanis, Jun 18 2009

Keywords

Examples

			Index of the first occurrence of 2 is 2 and that of the second occurrence is 5, separated by a(3) and a(4), two terms.

Crossrefs

A100798
Showing 1-4 of 4 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.