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.

Showing 1-3 of 3 results.

A051066 Partial sums of A051065.

Original entry on oeis.org

0, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 5, 6, 6, 7, 8, 8, 9, 9, 10, 10, 10, 11, 11, 11, 12, 12, 12, 13, 13, 13, 14, 14, 14, 15, 15, 16, 16, 17, 18, 18, 19, 20, 20, 21, 21, 22, 22, 22, 23, 23, 23, 24, 24, 24, 25, 25, 25, 26, 26, 26, 27, 27, 28, 28, 29, 30, 30, 31, 32, 32, 33, 33, 34, 34
Offset: 0

Views

Author

N. J. A. Sloane and Gary W. Adamson

Keywords

References

  • Letter from Gary W. Adamson concerning Prouhet-Thue-Morse sequence, Nov. 11, 1999.

Crossrefs

Cf. A004128, A051065, A051067.

Programs

  • Mathematica
    Accumulate[Join[{0}, Mod[Accumulate[Table[IntegerExponent[3*n, 3], {n, 1, 100}]], 2]]] (* Amiram Eldar, Jun 02 2025 *)

Formula

a(n) = Sum_{k=0..n} A051065(k). - Wesley Ivan Hurt, May 25 2024

Extensions

More terms from James Sellers, Dec 11 1999

A051067 A051066 read mod 2.

Original entry on oeis.org

0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1
Offset: 0

Views

Author

N. J. A. Sloane and Gary W. Adamson

Keywords

References

  • Letter from Gary W. Adamson concerning Prouhet-Thue-Morse sequence, Nov. 11, 1999.

Crossrefs

Cf. A004128, A051065, A051066.

Programs

  • Mathematica
    Mod[Accumulate[Join[{0}, Mod[Accumulate[Table[IntegerExponent[3*n, 3], {n, 1, 100}]], 2]]], 2] (* Amiram Eldar, Jun 02 2025 *)

Extensions

More terms from James Sellers, Dec 11 1999

A215604 a(0)=0, a(n) = (n + a(floor(n/2))) mod 3.

Original entry on oeis.org

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

Views

Author

Alex Ratushnyak, Aug 17 2012

Keywords

Crossrefs

Cf. A010060 ((n + a(floor(n/2))) mod 2).
Cf. A051065 ((n + a(floor(n/3))) mod 2).
Cf. A053838 ((n + a(floor(n/3))) mod 3).

Programs

  • Python
    TOP = 1000
a = [0]*TOP
for n in range(1, TOP):
    print(a[n-1], end=', ')
    a[n] = (n + a[n//2]) % 3
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.