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.

A047558 Numbers that are congruent to {1, 3, 6, 7} mod 8.

Original entry on oeis.org

1, 3, 6, 7, 9, 11, 14, 15, 17, 19, 22, 23, 25, 27, 30, 31, 33, 35, 38, 39, 41, 43, 46, 47, 49, 51, 54, 55, 57, 59, 62, 63, 65, 67, 70, 71, 73, 75, 78, 79, 81, 83, 86, 87, 89, 91, 94, 95, 97, 99, 102, 103, 105, 107, 110, 111, 113, 115, 118, 119, 121, 123, 126
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

Formula

From Wesley Ivan Hurt, May 29 2016: (Start)
G.f.: x*(1+2*x+3*x^2+x^3+x^4) / ((x-1)^2*(1+x+x^2+x^3)).
a(n) = a(n-1) + a(n-4) - a(n-5) for n>5.
a(n) = (8*n-3-i^(2*n)-i^(1-n)+i^(1+n))/4 where i=sqrt(-1).
a(2k) = A004767(k-1) for k>0, a(2k-1) = A047452(k). (End)
E.g.f.: (2 - sin(x) + (4*x - 1)*sinh(x) + (4*x - 2)*cosh(x))/2. - Ilya Gutkovskiy, May 30 2016
Sum_{n>=1} (-1)^(n+1)/a(n) = (2+sqrt(2))*Pi/16 + sqrt(2)*log(2+sqrt(2))/8 - (2+sqrt(2))*log(2)/16. - Amiram Eldar, Dec 24 2021