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.

A272729 a(n) is the number of repetitions of 2n-1 in A272727.

Original entry on oeis.org

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

Views

Author

Ivan Neretin, May 05 2016

Keywords

Comments

Also, value of A272728 at the n-th local maximum.
Also, the trajectory of 1 under the morphism n->[1,1..1,n+1] (the number of 1's is n-1).
Average value tends to 2.
Number n makes its first appearance at the position 2^(n-1) and has frequency 1/2^n.
Conjectured first differences of A037988 (true for at least 8192 terms). - Sean A. Irvine, Jun 26 2022

Examples

			The morphism acts as follows:
1->2; 2->1,3; 3->1,1,4; 4->1,1,1,5; etc.
The trajectory starts as:
1 ->
2 ->
1,3 ->
2,1,1,4 ->
1,3,2,2,1,1,1,5 -> ...
The result of k iterations is a series with 2^(k-1) terms; their sum is 2^k.
If A001511 is laid out in a similar irregular triangle, each row
would contain the same terms, albeit in a different order:
1,
2,
1,3,
1,2,1,4,
1,2,1,3,1,2,1,5...
		

Crossrefs

Programs

  • Mathematica
    Flatten@NestList[Flatten[Append[ConstantArray[1, # - 1], # + 1] & /@ #] &, {1}, 7]