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.

A230958 Boustrophedon transform of Thue-Morse sequence A001285.

Original entry on oeis.org

1, 3, 7, 15, 39, 127, 480, 2143, 10907, 62495, 397814, 2785861, 21282228, 176133285, 1569817724, 14990658724, 152693582275, 1652531857935, 18936620009722, 229053108410969, 2916394751599614, 38989325834726043, 546070266163669664, 7995699956778626764
Offset: 0

Views

Author

Reinhard Zumkeller, Nov 04 2013

Keywords

Crossrefs

Programs

  • Haskell
    a230958 n = sum $ zipWith (*) (a109449_row n) $ map fromIntegral a001285_list
    
  • Mathematica
    T[n_, k_] := (n!/k!) SeriesCoefficient[(1 + Sin[x])/Cos[x], {x, 0, n - k}];
    tm[n_] := Mod[Sum[Mod[Binomial[n, k], 2], {k, 0, n}], 3];
    Table[Sum[T[n, k] tm[k], {k, 0, n}], {n, 0, 23}] (* Jean-François Alcover, Jul 23 2019 *)
  • Python
    from itertools import accumulate, count, islice
    def A230958_gen(): # generator of terms
        blist = tuple()
        for i in count(0):
            yield (blist := tuple(accumulate(reversed(blist), initial=2 if i.bit_count()&1 else 1)))[-1]
    A230958_list = list(islice(A230958_gen(),30)) # Chai Wah Wu, Apr 17 2023

Formula

a(n) = Sum_{k=0..n} A109449(n,k)*A001285(k).