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.

A076054 a(n) = Sum_{k=1..n} A006513(k).

Original entry on oeis.org

1, 3, 5, 6, 7, 8, 10, 12, 14, 16, 17, 19, 21, 22, 23, 24, 26, 27, 28, 29, 30, 32, 34, 35, 36, 37, 38, 40, 42, 44, 46, 48, 49, 50, 51, 53, 55, 57, 59, 61, 63, 65, 66, 67, 68, 69, 70, 72, 74, 76, 78, 80, 82, 84, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 97, 99, 101, 103, 105, 107
Offset: 1

Views

Author

Benoit Cloitre, Oct 30 2002

Keywords

Crossrefs

Programs

  • PARI
    f(n) = if (n%2, (3*n+1)/2, n/2); \\ A014682
    g(n) = my(last = n); while (1, my(new = f(f(last))); if (new == last, return(new)); last = new;); \\ A006513
    a(n) = sum(k=1, n, g(k)); \\ Michel Marcus, Feb 03 2022

Formula

a(n) seems to be asymptotic to (3/2)*n.