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.

A232740 a(n) = Number of terms of A232739 which occur between each consecutive terms of A005228, in range A005228(n)..A005228(n+1).

Original entry on oeis.org

1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1
Offset: 1

Views

Author

Antti Karttunen, Dec 04 2013

Keywords

Comments

Do any other values appear than 1 and 2? The 2's seem to be getting rarer, as zeros correspondingly get rarer in A232750. This has some implications about how the ratio A005228(n)/A232739(n) will develop. Please see also the comments and graph-drawing link in A232739.

Examples

			The two sequences begin as:
A005228: 1, 3,    7, 12,      18,   26,     35,  45,   56,      69,   83, ...
A232739:  2,  4,6,  9,  13,17,   22,   28,34,  41,  49,   58,67,   77,   ...
Grouping together the terms of A232739 that occur between two successive terms of A232739, we get {2}, {4,6}, {9}, {13,17}, {22}, {28,34}, {41}, {49}, {58,67}, {77}, ... and counting how many terms are in each such group, we get 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, ..., the first terms of this sequence.
		

Crossrefs

Programs

Formula

a(n) = A232753(A005228(n+1)) - A232753(A005228(n)).