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.

A008812 Expansion of (1+x^5)/((1-x)^2*(1-x^5)).

Original entry on oeis.org

1, 2, 3, 4, 5, 8, 11, 14, 17, 20, 25, 30, 35, 40, 45, 52, 59, 66, 73, 80, 89, 98, 107, 116, 125, 136, 147, 158, 169, 180, 193, 206, 219, 232, 245, 260, 275, 290, 305, 320, 337, 354, 371, 388, 405, 424, 443, 462, 481, 500, 521, 542, 563, 584, 605, 628, 651, 674
Offset: 0

Views

Author

N. J. A. Sloane

Keywords

Comments

Number of 0..n arrays of six elements with zero second differences. - R. H. Hardin, Nov 16 2011
Also number of ordered triples (w,x,y) with all terms in {1,...,n+1} and w + 4*x = 5*y. Also the number of 3-tuples (w,x,y) with all terms in {1,...,n+1} and 5*w = 2*x +3*y. - Clark Kimberling, Apr 15 2012 [Corrected by Pontus von Brömssen, Jan 26 2020]
a(n) is also the number of 5 boxes polyomino (zig-zag patterns) packing into (n+3) X (n+3) square. See illustration in links. - Kival Ngaokrajang, Nov 10 2013
Also, number of ordered pairs (x,y) with both terms in {1,...,n+1} and x+4*y divisible by 5; or number of ordered pairs (x,y) with both terms in {1,...,n+1} and 2*x+3*y divisible by 5. - Pontus von Brömssen, Jan 26 2020

Examples

			For n = 5 there are 8 0..5 arrays of six elements with zero second differences: [0,0,0,0,0,0], [0,1,2,3,4,5], [1,1,1,1,1,1], [2,2,2,2,2,2], [3,3,3,3,3,3], [4,4,4,4,4,4], [5,4,3,2,1,0], [5,5,5,5,5,5].

Links

Crossrefs

Cf. A130497 (first differences).
Cf. Expansions of the form (1+x^m)/((1-x)^2*(1-x^m)): A000290 (m=1), A000982 (m=2), A008810 (m=3), A008811 (m=4), this sequence (m=5), A008813 (m=6), A008814 (m=7), A008815 (m=8), A008816 (m=9), A008817 (m=10).

Programs

  • GAP
    a:=[1,2,3,4,5,8,11];; for n in [8..65] do a[n]:=2*a[n-1]-a[n-2] +a[n-5]-2*a[n-6]+a[n-7]; od; a; # G. C. Greubel, Sep 12 2019
  • Magma
    R:=PowerSeriesRing(Integers(), 65); Coefficients(R!( (1+x^5)/((1-x)^2*(1-x^5)) )); // G. C. Greubel, Sep 12 2019
  • Maple
    seq(coeff(series((1+x^5)/((1-x)^2*(1-x^5)), x, n+1), x, n), n = 0..65); # G. C. Greubel, Sep 12 2019
  • Mathematica
    CoefficientList[Series[(1+x^5)/(1-x)^2/(1-x^5),{x,0,65}],x] (* or *) LinearRecurrence[{2,-1,0,0,1,-2,1}, {1,2,3,4,5,8,11}, 65] (* Harvey P. Dale, Apr 17 2015 *)
  • PARI
    Vec((1+x^5)/(1-x)^2/(1-x^5)+O(x^65)) \\ Charles R Greathouse IV, Sep 25 2012
  • Sage
    def A008812_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P((1+x^5)/((1-x)^2*(1-x^5))).list()
A008812_list(65) # G. C. Greubel, Sep 12 2019

Formula

G.f.: (1+x^5)/((1-x)^2*(1-x^5)).
a(n) = 2*a(n-1) -a(n-2) +a(n-5) -2*a(n-6) +a(n-7). - R. H. Hardin, Nov 16 2011

Extensions

More terms added by G. C. Greubel, Sep 12 2019

A212120 Triangle read by rows T(n,k), n>=1, k>=1, where T(n,k) is the sum of the divisors d of n with min(d, n/d) = k.

Original entry on oeis.org

1, 3, 5, 7, 1, 9, 1, 11, 3, 13, 3, 15, 5, 17, 5, 1, 19, 7, 1, 21, 7, 1, 23, 9, 3, 25, 9, 3, 27, 11, 3, 29, 11, 5, 31, 13, 5, 1, 33, 13, 5, 1, 35, 15, 7, 1, 37, 15, 7, 1, 39, 17, 7, 3, 41, 17, 9, 3, 43, 19, 9, 3, 45, 19, 9, 3, 47, 21, 11, 5, 49, 21, 11, 5, 1
Offset: 1

Views

Author

Omar E. Pol, Jul 02 2012

Keywords

Comments

Column k lists the odd numbers repeated k times starting in row k^2.
1 together with the first differences of the row sums give the divisor function A000005.
T(n,k) is also the total number of divisors of all positive integers <= n on the edges of k-th triangle in the diagram of divisors (see link section). See also A212119.

Examples

			Written as an irregular triangle the sequence begins:
1;
3;
5;
7,   1;
9,   1;
11,  3;
13,  3;
15,  5;
17,  5,  1;
19,  7,  1;
21,  7,  1;
23,  9,  3;
25,  9,  3;
27, 11,  3;
29, 11,  5;
31, 13,  5,  1;
33, 13,  5,  1;
35, 15,  7,  1;
37, 15,  7,  1;
39, 17,  7,  3;
41, 17,  9,  3;
43, 19,  9,  3;
45, 19,  9,  3;
47, 21, 11,  5;
49, 21, 11,  5,  1;

Links

Crossrefs

Row sums give A006218, n >= 1.
Columns (1-5): A005408, A109613, A130823, A129756, A130497.
Cf. A000005, A027750, A010766, A147861, A163100, A212119.

Formula

T(n,k) = Sum_{j=1..n} A212119(j,k).

Extensions

Definition changed by Franklin T. Adams-Watters, Jul 12 2012

A226203 a(5n) = a(5n+3) = a(5n+4) = 2n+1, a(5n+1) = 2n-3, a(5n+2) = 2n-1.

Original entry on oeis.org

1, -3, -1, 1, 1, 3, -1, 1, 3, 3, 5, 1, 3, 5, 5, 7, 3, 5, 7, 7, 9, 5, 7, 9, 9, 11, 7, 9, 11, 11, 13, 9, 11, 13, 13, 15, 11, 13, 15, 15, 17, 13, 15, 17, 17, 19, 15, 17, 19, 19, 21, 17, 19, 21, 21, 23, 19, 21, 23, 23, 25, 21, 23, 25, 25
Offset: 0

Views

Author

Paul Curtz, May 31 2013

Keywords

Comments

Given the numerators of A225948/A226008 ordered according to A226096: 0, -15, -3, 2, 3, 6, -7, 5, 12, 15, 20, 9, 21, 30, 35,... = t(n), then (a(n) + t(n)/a(n))^2 = A226096(n).
First six differences (of period 5):
...-4, 2, 2, 0, 2, -4, 2, 2, 0, 2, ...
....6, 0, -2, 2, -6, 6, 0, -2, 2, -6, ...
...-6, -2, 4, -8, 12, -6, -2, 4, -8, 12, ...
....4, 6, -12, 20, -18, 4, 6, -12, 20, -18, ...
....2, -18, 32, -38, 22, 2, -18, 32, -38, 22, ...
..-20, 50, -70, 60, -20, -20, 50, -70, 60, -20, ...

Links

Crossrefs

Cf. A007395, A005408, A130497, A226096.

Programs

  • Haskell
    import Data.List (transpose)
a226203 n = a226203_list !! n
a226203_list = concat $ transpose
               [[1, 3 ..], [-3, -1 ..], [-1, 1 ..], [1, 3 ..], [1, 3 ..]]
-- Reinhard Zumkeller, Jun 02 2013
  • Mathematica
    a[n_] := 2 Quotient[n, 5] + Switch[Mod[n, 5], 0, 1, 1, -3, 2, -1, 3, 1, 4, 1]; Table[a[n], {n, 0, 64}] (* Jean-François Alcover, Jun 22 2017 *)

Formula

a(n+5) = a(n) + 2.
G.f.: (1-4*x+2*x^2+2*x^3+x^5)/((1-x)^2*(1+x+x^2+x^3+x^4)). [Bruno Berselli, Jun 01 2013]
a(n) = a(n-1)+a(n-5)-a(n-6) with a(0)=a(3)=a(4)=1, a(1)=-3, a(2)=-1, a(5)=3. [Bruno Berselli, Jun 01 2013]

Extensions

Edited by Bruno Berselli, Jun 01 2013
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.