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

A055175 Number of new numbers in n-th segment of A055174; see example line of A055174.

Original entry on oeis.org

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

Views

Author

Clark Kimberling, Apr 27 2000

Keywords

Comments

Also, the number of new numbers in n-th segment of A055190.

A055176 n-th distinct number to appear in A055174; also the n-th to appear in A055190.

Original entry on oeis.org

2, 1, 4, 3, 5, 6, 7, 8, 9, 10, 12, 13, 15, 16, 18, 19, 21, 11, 22, 24, 25, 28, 31, 34, 33, 36, 23, 26, 20, 17, 38, 29, 45, 30, 14, 42, 48, 32, 44, 52, 35, 37, 47, 56, 40, 27, 51, 61, 43, 57, 65, 41, 39, 69, 49, 74, 54, 71, 76, 59, 73, 79, 62
Offset: 1

Views

Author

Clark Kimberling, Apr 27 2000

Keywords

Comments

Conjecture: this sequence is a permutation of the positive integers.

A055181 Number of new numbers in n-th segment of A055174; see example line of A055174.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 2, 4, 3, 2, 2, 3, 2, 2, 4, 4, 3, 2, 4, 2, 4, 4, 4, 2, 3, 2, 4, 2, 7, 4
Offset: 1

Views

Author

Clark Kimberling, Apr 27 2000

Keywords

Comments

Also, the number of new numbers in n-th segment of A055192.

A055182 n-th distinct number to appear in A055174.; also the n-th to appear in A055192.

Original entry on oeis.org

4, 1, 2, 3, 5, 6, 7, 8, 9, 10, 12, 14, 13, 17, 11, 15, 19, 16, 22, 25, 27, 20, 24, 29, 21, 18, 26, 32, 23, 36, 28, 40, 31, 30, 43, 34, 46, 35, 49, 37, 52, 42, 38, 33, 55, 45, 44, 41, 39, 58, 50, 63, 53, 66, 57, 54, 48, 69, 59, 74, 62, 60, 51
Offset: 1

Views

Author

Clark Kimberling, Apr 27 2000

Keywords

Comments

Conjecture: this sequence is a permutation of the positive integers.

A055168 Cumulative counting sequence: method B (noun,adjective)-pairs with first term 0.

Original entry on oeis.org

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

Views

Author

Clark Kimberling, Apr 27 2000

Keywords

Comments

Write 0 followed by segments defined inductively as follows: each segment tells how many times each previously written integer occurs, stating first the integer being counted and then its frequency. This is Method B (noun-before-adjective); for Method A (adjective-before-noun), see A217760. - Clark Kimberling, Mar 25 2013

Examples

			Start with 0, then 0,1; then 2,0 and 1,1; etc.
Writing pairs vertically, the initial segments are
0..0..0 1..0 1 2..0 1 2 3..0 1 2 3 4 5..0 1 2 3 4 5 6..0  1 2 3 4 5 6 9
...1..2 1..3 3 1..4 5 2 2..5 6 5 3 1 1..6 9 6 5 2 4 1..7 11 8 6 4 6 3 1
The 5th segment tells that 0 has been written 4 times, 1 5 times, 2 2 times, and 3 2 times. The nouns are 1 2 3; the adjectives, 5 2 2.  - _Clark Kimberling_, Mar 25 2013

Links

Crossrefs

Cf. A217760, A055170.
Cf. A055171, A055174, A055177, A055180, A055183.
See A001155 and A022470 for well-known counting sequences using methods A and B.

Programs

  • Mathematica
    s = {0}; Do[s = Flatten[{s, {#,Count[s, #]} & /@ DeleteDuplicates[s]}], {24}]; s (* Peter J. C. Moses, Mar 21 2013 *)

Extensions

Conjecture removed by Clark Kimberling, Oct 24 2009
Showing 1-5 of 5 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.