Sequences
392,541 sequences
- a(n) = T(n,n-6), array T as in A055807.A055811
a(n) = T(n,n-6), array T as in A055807.
- a(n) and floor(a(n)/5) are both squares; i.e., squares which remain squares when written in base 5 and last digit is removed.A055812
a(n) and floor(a(n)/5) are both squares; i.e., squares which remain squares when written in base 5 and last digit is removed.
- Primes arising in A064205.A055813
Primes arising in A064205.
- Expansion of e.g.f.: exp(x^3/3 + x^2/2).A055814
Expansion of e.g.f.: exp(x^3/3 + x^2/2).
- a(n) = T(2*n+3,n), array T as in A055807.A055815
a(n) = T(2*n+3,n), array T as in A055807.
- a(n) = T(2*n+4,n), array T as in A055807.A055816
a(n) = T(2*n+4,n), array T as in A055807.
- a(n) = T(2n+5,n), array T as in A055807.A055817
a(n) = T(2n+5,n), array T as in A055807.
- Triangle T read by rows: T(i,j) = R(i-j,j), where R(i,0) = R(0,i) = 1 for i >= 0, R(i,j) = Sum_{h=0..i-1} Sum_{m=0..j} R(h,m) for i >= 1, j >= 1.A055818
Triangle T read by rows: T(i,j) = R(i-j,j), where R(i,0) = R(0,i) = 1 for i >= 0, R(i,j) = Sum_{h=0..i-1} Sum_{m=0..j} R(h,m) for i >= 1, j >= 1.
- Row sums of array T in A055818; twice the odd-indexed Fibonacci numbers after initial term.A055819
Row sums of array T in A055818; twice the odd-indexed Fibonacci numbers after initial term.
- a(n) = T(n,n-3), array T as in A055818.A055820
a(n) = T(n,n-3), array T as in A055818.
- a(n) = T(n,n-4), array T as in A055818.A055821
a(n) = T(n,n-4), array T as in A055818.
- a(n) = T(n, n-5), array T as in A055818.A055822
a(n) = T(n, n-5), array T as in A055818.
- a(n) = T(n,n-6), array T as in A055818.A055823
a(n) = T(n,n-6), array T as in A055818.
- a(n) = T(2*n,n), array T as in A055818.A055824
a(n) = T(2*n,n), array T as in A055818.
- a(n) = T(2n+1,n), array T as in A055818.A055825
a(n) = T(2n+1,n), array T as in A055818.
- a(n) = T(2n+2,n), array T as in A055818.A055826
a(n) = T(2n+2,n), array T as in A055818.
- a(n) = T(2n+3,n), array T as in A055818.A055827
a(n) = T(2n+3,n), array T as in A055818.
- a(n) = T(2n+4,n), array T as in A055818.A055828
a(n) = T(2n+4,n), array T as in A055818.
- a(n) = T(2n+5,n), array T as in A055818.A055829
a(n) = T(2n+5,n), array T as in A055818.
- Triangle T read by rows: diagonal differences of triangle A037027.A055830
Triangle T read by rows: diagonal differences of triangle A037027.
- T(n,n-4), where T is the array in A055830.A055831
T(n,n-4), where T is the array in A055830.
- T(n,n-5), where T is the array in A055830.A055832
T(n,n-5), where T is the array in A055830.
- T(n,n-6), where T is the array in A055830.A055833
T(n,n-6), where T is the array in A055830.
- a(n) = T(2n,n), where T is the array in A055830.A055834
a(n) = T(2n,n), where T is the array in A055830.
- T(2n+1,n), where T is the array in A055830.A055835
T(2n+1,n), where T is the array in A055830.
- T(2n+2, n), where T is the array in A055830.A055836
T(2n+2, n), where T is the array in A055830.
- T(2n+3,n), where T is the array in A055830.A055837
T(2n+3,n), where T is the array in A055830.
- T(2n+4,n), where T is the array in A055830.A055838
T(2n+4,n), where T is the array in A055830.
- T(2n+5,n), where T is the array in A055830.A055839
T(2n+5,n), where T is the array in A055830.
- T(2n+6,n), where T is the array in A055830.A055840
T(2n+6,n), where T is the array in A055830.
- Number of compositions of n into 3*j-1 kinds of j's for all j >= 1.A055841
Number of compositions of n into 3*j-1 kinds of j's for all j >= 1.
- Expansion of (1-x)^2/(1-5*x).A055842
Expansion of (1-x)^2/(1-5*x).
- Expansion of (1+3*x)/(1-x)^10.A055843
Expansion of (1+3*x)/(1-x)^10.
- a(n) = (5*n + 9)*binomial(n+8, 8)/9.A055844
a(n) = (5*n + 9)*binomial(n+8, 8)/9.
- a(n) = 4*a(n-1) - a(n-2) with a(0)=1, a(1)=8.A055845
a(n) = 4*a(n-1) - a(n-2) with a(0)=1, a(1)=8.
- a(n) = 25*6^(n-2), with a(0)=1 and a(1)=4.A055846
a(n) = 25*6^(n-2), with a(0)=1 and a(1)=4.
- a(0)=1, a(1)=6, a(n)=49*8^(n-2) if n>=2.A055847
a(0)=1, a(1)=6, a(n)=49*8^(n-2) if n>=2.
- Expansion of (1+5*x)/(1-x)^10.A055848
Expansion of (1+5*x)/(1-x)^10.
- a(n) = 3*a(n-1) - a(n-2) with a(0)=1, a(1)=9.A055849
a(n) = 3*a(n-1) - a(n-2) with a(0)=1, a(1)=9.
- a(n) = 3*a(n-1) - a(n-2) with a(0)=1, a(1)=10.A055850
a(n) = 3*a(n-1) - a(n-2) with a(0)=1, a(1)=10.
- a(n) and floor(a(n)/6) are both squares; i.e., squares that remain squares when written in base 6 and last digit is removed.A055851
a(n) and floor(a(n)/6) are both squares; i.e., squares that remain squares when written in base 6 and last digit is removed.
- Convolution of A055589 with A011782.A055852
Convolution of A055589 with A011782.
- Convolution of A055852 with A011782.A055853
Convolution of A055852 with A011782.
- Convolution of A055853 with A011782.A055854
Convolution of A055853 with A011782.
- Convolution of A055854 with A011782.A055855
Convolution of A055854 with A011782.
- Susceptibility series H_4 for 2-dimensional Ising model (divided by 2).A055856
Susceptibility series H_4 for 2-dimensional Ising model (divided by 2).
- Susceptibility series H_6 for 2-dimensional Ising model (divided by 2).A055857
Susceptibility series H_6 for 2-dimensional Ising model (divided by 2).
- Coefficient triangle for certain polynomials.A055858
Coefficient triangle for certain polynomials.
- a(n) and floor(a(n)/7) are both squares; i.e., squares which remain squares when written in base 7 and last digit is removed.A055859
a(n) and floor(a(n)/7) are both squares; i.e., squares which remain squares when written in base 7 and last digit is removed.
- a(n) = A000169(n+1) if n > 0; a(0) = 0.A055860
a(n) = A000169(n+1) if n > 0; a(0) = 0.