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.

A113725 The number of terms in row n of A113724 when interpreted as a triangle.

Original entry on oeis.org

1, 2, 8, 56, 984, 87848, 115679160
Offset: 1

Views

Author

Floor van Lamoen and Paul D. Hanna, Nov 08 2005

Keywords

Comments

A113724 is a variant of Golomb's sequence using even numbers: a(n) is the number of times 2*n+2 occurs, starting with a(1) = 2.

Crossrefs

Cf. A001462 (Golomb's sequence), A113722, A113723, A113724, A113676.

A113722 A variant of Golomb's sequence using odd numbers: a(n) is the number of times 2*n+1 occurs, starting with a(1) = 1.

Original entry on oeis.org

1, 3, 5, 5, 5, 7, 7, 7, 7, 7, 9, 9, 9, 9, 9, 11, 11, 11, 11, 11, 13, 13, 13, 13, 13, 13, 13, 15, 15, 15, 15, 15, 15, 15, 17, 17, 17, 17, 17, 17, 17, 19, 19, 19, 19, 19, 19, 19, 21, 21, 21, 21, 21, 21, 21, 23, 23, 23, 23, 23, 23, 23, 23, 23, 25, 25, 25, 25, 25, 25, 25, 25, 25, 27
Offset: 0

Views

Author

Floor van Lamoen and Paul D. Hanna, Nov 08 2005

Keywords

Comments

a(n) is taken to be the smallest number >= a(n-1) which is compatible with the description.

Examples

			Start with 1 in row 1 and form a triangle where row n is generated from row n-1 by the rule given in the description. Then row 2 will have (1) 3, row 3 will have (3) 5's, row 4 will have (5) 7's, (5) 9's and (5) 11's, etc.
The triangle begins:
1;
3;
5,5,5;
7,7,7,7,7,9,9,9,9,9,11,11,11,11,11; ...
The number of terms in each row (also row sums with offset) is given by A113723: [1,1,3,15,135,3845,769605,3821696361,...].

Crossrefs

Cf. A001462 (Golomb's sequence), A113723, A113724, A113676.

Programs

  • PARI
    a=[1,3,5,5,5];for(n=3,20, for(i=1,a[n],a=concat(a,2*n+1)));a

A113723 The number of terms in row n of A113722 when interpreted as a triangle.

Original entry on oeis.org

1, 1, 3, 15, 135, 3845, 769605, 3821696361
Offset: 1

Views

Author

Floor van Lamoen and Paul D. Hanna, Nov 08 2005

Keywords

Comments

A113722 is a variant of Golomb's sequence using odd numbers: a(n) is the number of times 2*n+1 occurs, starting with a(1) = 1.

Crossrefs

Cf. A001462 (Golomb's sequence), A113722, A113724, A113725, A113676.
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.