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.

A145365 Row sums of triangle A145364 (S1hat(-2)) and partition array A145363 (M31hat(-2)).

Original entry on oeis.org

1, 3, 5, 9, 13, 25, 33, 57, 81, 129, 177, 289, 385, 609, 833, 1281, 1729, 2689, 3585, 5505, 7425, 11265, 15105, 23041, 30721
Offset: 1

Views

Author

Wolfdieter Lang, Oct 17 2008

Keywords

Crossrefs

Formula

a(n) = Sum_{m=1..n} A145364(n,m), n>=1.

Extensions

Offset changed from 0 to 1. - Wolfdieter Lang, Nov 25 2008

A145363 Partition number array, called M31hat(-2).

Original entry on oeis.org

1, 2, 1, 2, 2, 1, 0, 2, 4, 2, 1, 0, 0, 4, 2, 4, 2, 1, 0, 0, 0, 4, 0, 4, 8, 2, 4, 2, 1, 0, 0, 0, 0, 0, 0, 4, 8, 0, 4, 8, 2, 4, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 0, 4, 8, 16, 0, 4, 8, 2, 4, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 8, 16, 0, 0, 4, 8, 16, 0, 4, 8, 2, 4, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0
Offset: 1

Views

Author

Wolfdieter Lang, Oct 17 2008

Keywords

Comments

If all positive numbers are replaced by 1 this becomes the characteristic partition array for partitions with parts 1,2 or 3 only, provided the partitions of n are ordered like in Abramowitz-Stegun (A-St order; for the reference see A134278).
Second member (K=2) in the family M31hat(-K) of partition number arrays.
The sequence of row lengths is A000041 (partition numbers) [1, 2, 3, 5, 7, 11, 15, 22, 30, 42,...].
This array is array A144358 divided entrywise by the array M_3=M3(1)=A036040. Formally 'A144358/A036040'. E.g. a(4,3)= 4 = 12/3 = A144358(4,3)/A036040(4,3).
If M31hat(-2;n,k) is summed over those k belonging to partitions with fixed number of parts m one obtains the unsigned triangle S1hat(-2):= A145364.

Examples

			Triangle begins
  [1];
  [2,1];
  [2,2,1];
  [0,2,4,2,1];
  [0,0,4,2,4,2,1];
  ...
a(4,3)= 4 = S1(-2;2,1)^2. The relevant partition of 4 is (2^2).
		

Crossrefs

Cf. A145361 (M31hat(-1)). A145366 (M31hat(-3)).

Formula

a(n,k) = product(S1(-2;j,1)^e(n,k,j),j=1..n) with S1(-2;n,1) = A008279(2,n-1) = [1,2,1,0,0,0,...], n>=1 and the exponent e(n,k,j) of j in the k-th partition of n in the A-St ordering of the partitions of n.

A145368 Row sums of triangle A145367 (S1hat(-3)) and partition array A145366 (M31hat(-3)).

Original entry on oeis.org

1, 4, 10, 25, 43, 124, 214, 493, 979, 2032, 3706, 8377, 14695, 30004, 58030, 113029, 204883, 424312, 754306, 1467025, 2783599, 5248348, 9524662, 18925117, 33713611
Offset: 0

Views

Author

Wolfdieter Lang, Oct 17 2008

Keywords

Crossrefs

Cf. A145367, A145366, A145365 (row sums of triangle A145364).

Formula

a(n) = Sum_{m=1..n} A145367(n,m), for n>=1.
Showing 1-3 of 3 results.