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.

A282711 a(n) is the number of terms of A003052 that are <= n.

Original entry on oeis.org

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

Views

Author

N. J. A. Sloane, Feb 27 2017

Keywords

Crossrefs

Cf. A003052.

Programs

  • Maple
    # Assumes the array b52 contains a list of the terms in A003052.
    p:=[]; t:=1; m:=b52[t]; c:=1;
    for n from 1 to 1000 do
    if n=m then c:=c+1; t:=t+1; m:=b52[t]; fi;
    p:=[op(p),c];
    od:
    p;

Formula

Zannier shows that a(n) = L*n + O((log x)^2), where L is approximately 10.227...