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

A005995 Alkane (or paraffin) numbers l(8,n).

Original entry on oeis.org

1, 3, 12, 28, 66, 126, 236, 396, 651, 1001, 1512, 2184, 3108, 4284, 5832, 7752, 10197, 13167, 16852, 21252, 26598, 32890, 40404, 49140, 59423, 71253, 85008, 100688, 118728, 139128, 162384, 188496, 218025, 250971, 287964, 329004, 374794, 425334, 481404, 543004
Offset: 0

Views

Author

N. J. A. Sloane, Winston C. Yang (yang(AT)math.wisc.edu)

Keywords

Comments

From M. F. Hasler, May 01 2009: (Start)
Also, number of 5-element subsets of {1,...,n+5} whose elements sum to an odd integer, i.e. column 5 of A159916.
A linear recurrent sequence with constant coefficients and characteristic polynomial x^9 - 3*x^8 + 8*x^6 - 6*x^5 - 6*x^4 + 8*x^3 - 3*x + 1. (End)
Equals (1/2)*((1, 6, 21, 56, 126, 252, ...) + (1, 0, 3, 0, 6, 0, 10, ...)), see A000389 and A000217.
Equals row sums of triangle A160770.
F(1,5,n) is the number of bracelets with 1 blue, 5 identical red and n identical black beads. If F(1,5,1) = 3 and F(1,5,2) = 12 taken as a base, F(1,5,n) = n(n+1)(n+2)(n+3)/24 + F(1,3,n) + F(1,5,n-2). [F(1,3,n) is the number of bracelets with 1 blue, 3 identical red and n identical black beads. If F(1,3,1) = 2 and F(1,3,2) = 6 taken as a base F(1,3,n) = n(n+1)/2 + [|n/2|] + 1 + F(1,3,n-2)], where [|x|]: if a is an integer and a<=x

References

  • S. M. Losanitsch, Die Isomerie-Arten bei den Homologen der Paraffin-Reihe, Chem. Ber. 30 (1897), 1917-1926.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
  • Winston C. Yang (paper in preparation).

Crossrefs

Cf. A160770, A053132 (bisection), A271870 (bisection), A018210 (partial sums).

Programs

  • Maple
    a:= n-> (Matrix([[1, 0$6, -3, -9]]). Matrix(9, (i,j)-> if (i=j-1) then 1 elif j=1 then [3, 0, -8, 6, 6, -8, 0, 3, -1][i] else 0 fi)^n)[1, 1]: seq(a(n), n=0..40); # Alois P. Heinz, Jul 31 2008
  • Mathematica
    a[n_?OddQ] := 1/240*(n+1)*(n+2)*(n+3)*(n+4)*(n+5); a[n_?EvenQ] := 1/240*(n+2)*(n+4)*(n+6)*(n^2+3*n+5); Table[a[n], {n, 0, 32}] (* Jean-François Alcover, Mar 17 2014, after M. F. Hasler *)
    LinearRecurrence[{3, 0, -8, 6, 6, -8, 0, 3, -1},{1, 3, 12, 28, 66, 126, 236, 396, 651},40] (* Ray Chandler, Sep 23 2015 *)
  • PARI
    a(k)= if(k%2,(k+1)*(k+3)*(k+5),(k+6)*(k^2+3*k+5))*(k+2)*(k+4)/240 \\ M. F. Hasler, May 01 2009

Formula

G.f.: (1+3*x^2)/((1-x)^3*(1-x^2)^3).
a(2n-1) = n(n+1)(n+2)(2n+1)(2n+3)/30, a(2n) = (n+1)(n+2)(n+3)(4n^2+6n+5)/ 30. [M. F. Hasler, May 01 2009]
a(n) = (1/240)*(n+1)*(n+2)*(n+3)*(n+4)*(n+5) + (1/16)*(n+2)*(n+4)*(1/2)*(1+(-1)^n). [Yosu Yurramendi, Jun 20 2013]
a(n) = A038163(n)+3*A038163(n-2). - R. J. Mathar, Mar 29 2018

A177878 Triangle in which row n is generated from (1,2,3,...,n) dot (n, n-1,...,1) with subtractive carryovers.

Original entry on oeis.org

1, 2, 0, 3, 1, 2, 4, 2, 4, 0, 5, 3, 6, 2, 3, 6, 4, 8, 4, 6, 0, 7, 5, 10, 6, 9, 3, 4, 8, 6, 12, 8, 12, 6, 8, 0, 9, 7, 14, 10, 15, 9, 12, 4, 5, 10, 8, 16, 12, 18, 12, 16, 8, 10, 0, 11, 9, 18, 14, 21, 15, 20, 12, 15, 5, 6, 12, 10, 20, 16, 24, 18, 24, 16, 20, 10, 12, 0
Offset: 0

Author

Gary W. Adamson, Dec 13 2010

Keywords

Comments

The subtractive carryover dot product of two vectors (a(1),a(2),...,a(n)) dot (b(1),b(2),...,b(n)) = (c(1),...,c(n)) is defined by c(1) = a(1)*b(1) and c(i) = a(i)*b(i)-c(i-1), i>1.
A177877 = analogous triangle with additive carryovers.
A160770 = the analogous triangle using the triangular series as the generating vector.

Examples

			Row 3 = (4, 2, 4, 0) = (1, 2, 3, 4) dot (4, 3, 2, 1) with subtractive carryovers = (4), then (2*3 - 4 = 2), (3*2 - 2 = 4), and (4*1 - 4 = 0).
First few rows of the triangle:
  1;
  2, 0;
  3, 1, 2;
  4, 2, 4, 0;
  5, 3, 6, 2, 3;
  6, 4, 8, 4, 6, 0;
  7, 5, 10, 6, 9, 3, 4;
  8, 6, 12, 8, 12, 6, 8, 0;
  9, 7, 14, 10, 15, 9, 12, 4, 5;
  10, 8, 16, 12, 18, 12, 16, 8, 10, 0;
  11, 9, 18, 14, 21, 15, 20, 12, 15, 5, 6;
  12, 10, 20, 16, 24, 18, 24, 16, 20, 10, 12, 0;
  ...
		

Crossrefs

Cf. A005993 (row sums), A177877, A160770

Formula

By rows, dot product of (1,2,3,...) and (...3,2,1) with subtractive carryovers; such that current row product subtracts previous product.
Showing 1-2 of 2 results.