STATUS
proposed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A050024
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the smallest integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = a(3) = 1.
(history; published version)
(history; published version)
STATUS
editing
proposed
PROG
(PARI) lista(nn) = {nn = max(nn, 3); my(va = vector(nn)); va[1] = 1; va[2] = 1; va[3] = 1; for(n=4, nn, va[n] = va[n-1] + va[2*n - 3 - 2*2^logint(n-2, 2)]); va; } \\ Petros Hadjicostas, May 03 2020
PROG
(PARI) lista(nn) = { nn = max(nn, 3); my(va = vector(nn)); va[1] = 1; va[2] = 1; va[3] = 1; for (n=4, nn, va[n] = va[n-1] + va[2*n - 3 - 2*2^logint(n-2, 2)]); va; } \\ Petros Hadjicostas, May 03 2020
PROG
(PARI) lista(nn) = { nn = max(nn, 3); my(va = vector(nn)); va[1] = 1; va[2] = 1; va[3] = 1; for (n=4, nn, va[n] = va[n-1] + va[2*n - 3 - 2*2^logint(n-2, 2)]); va; } \\ Petros Hadjicostas, May 03 2020
PROG
(PARI) lista(nn) = { nn = max(nn, 3); my(va = vector(nn)); va[1] = 1; va[2] = 1; va[3] = 1; for (n=4, nn, va[n] = va[n-1] + va[2*n - 3 - 2*2^logint(n-2, 2)]); va; } \\ Petros Hadjicostas, May 03 2020
STATUS
approved
editing
STATUS
reviewed
approved
STATUS
proposed
reviewed
STATUS
editing
proposed
EXTENSIONS
Name edited by Petros Hadjicostas, Nov 08 2019
STATUS
proposed
editing