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-1 of 1 results.

A131793 3 odds, 3 evens.

Original entry on oeis.org

1, 3, 5, 2, 4, 6, 7, 9, 11, 8, 10, 12, 13, 15, 17, 14, 16, 18, 19, 21, 23, 20, 22, 24, 25, 27, 29, 26, 28, 30, 31, 33, 35, 32, 34, 36, 37, 39, 41, 38, 40, 42, 43, 45, 47, 44, 46, 48, 49, 51, 53, 50, 52, 54, 55, 57, 59, 56, 58, 60, 61, 63, 65, 62, 64, 66, 67, 69, 71, 68, 70, 72
Offset: 1

Views

Author

Paul Curtz, Oct 23 2007

Keywords

Crossrefs

Cf. A271833.

Programs

  • Maple
    f:= gfun:-rectoproc({a(n) = a(n-1)+a(n-6)-a(n-7), a(1)=1,a(2)=3,a(3)=5,a(4)=2,a(5)=4,a(6)=6,a(7)=7},a(n),remember):
    map(f, [$1..100]); # Robert Israel, May 10 2020
  • Mathematica
    LinearRecurrence[{1, 0, 0, 0, 0, 1, -1}, {1, 3, 5, 2, 4, 6, 7}, 100] (* Amiram Eldar, Feb 09 2023 *)

Formula

a(n) = 2*(3*floor((n-1)/6)+((n-1) mod 3)+1)-(floor((n+2)/3) mod 2). - Joshua Zucker, Aug 29 2012
G.f.: x*(1 + 2*x + 2*x^2 - 3*x^3 + 2*x^4 + 2*x^5)/(1 - x - x^6 + x^7). - Robert Israel, May 10 2020
Sum_{n>=1} (-1)^(n+1)/a(n) = log(2)/3 + log(3)/2 - Pi/(6*sqrt(3)). - Amiram Eldar, Feb 09 2023
Showing 1-1 of 1 results.