Sequences
392,541 sequences
- Jacobi form of weight 12 and index 1 for Niemeier lattice of type A_6^4.A055761
Jacobi form of weight 12 and index 1 for Niemeier lattice of type A_6^4.
- Jacobi form of weight 12 and index 1 for Niemeier lattice of type A_5^4 D_4 or D_4^6.A055762
Jacobi form of weight 12 and index 1 for Niemeier lattice of type A_5^4 D_4 or D_4^6.
- Jacobi form of weight 12 and index 1 for Niemeier lattice of type A_4^6.A055763
Jacobi form of weight 12 and index 1 for Niemeier lattice of type A_4^6.
- Jacobi form of weight 12 and index 1 for Niemeier lattice of type A_3^8.A055764
Jacobi form of weight 12 and index 1 for Niemeier lattice of type A_3^8.
- Jacobi form of weight 12 and index 1 for Niemeier lattice of type A_2^12.A055765
Jacobi form of weight 12 and index 1 for Niemeier lattice of type A_2^12.
- Jacobi form of weight 12 and index 1 for Niemeier lattice of type A_1^24.A055766
Jacobi form of weight 12 and index 1 for Niemeier lattice of type A_1^24.
- Index (or subscript) k of the largest primorial A002110(k) that divides the Euler phi of the n-th primorial (A005867(n)).A055767
Index (or subscript) k of the largest primorial A002110(k) that divides the Euler phi of the n-th primorial (A005867(n)).
- Number of distinct primes dividing phi of n-th primorial number.A055768
Number of distinct primes dividing phi of n-th primorial number.
- Largest prime dividing phi of the n-th primorial.A055769
Largest prime dividing phi of the n-th primorial.
- Largest factorial number which divides n.A055770
Largest factorial number which divides n.
- Multiplicity of irreducible character IRR2 of Monster simple group in n-th head character.A055771
Multiplicity of irreducible character IRR2 of Monster simple group in n-th head character.
- Square root of largest square dividing n!.A055772
Square root of largest square dividing n!.
- a(n) = Product_{p in P_n} where P_n = {p prime, n/2 < p <= n }.A055773
a(n) = Product_{p in P_n} where P_n = {p prime, n/2 < p <= n }.
- Least common multiple of n! and n^n.A055774
Least common multiple of n! and n^n.
- a(n) = floor(n^n / n!).A055775
a(n) = floor(n^n / n!).
- a(n) = a(n-1)^3 + a(n-1)^2 + a(n-1) + 1.A055776
a(n) = a(n-1)^3 + a(n-1)^2 + a(n-1) + 1.
- a(n) = 3^(3^n).A055777
a(n) = 3^(3^n).
- Number of 1's in the base-phi representation of n.A055778
Number of 1's in the base-phi representation of n.
- Number of fat trees on n labeled vertices.A055779
Number of fat trees on n labeled vertices.
- Number of symmetric types of (3,2n)-hypergraphs under action of complementing group C(3,2).A055780
Number of symmetric types of (3,2n)-hypergraphs under action of complementing group C(3,2).
- Primes q of the form q = 10p + 1, where p is also prime.A055781
Primes q of the form q = 10p + 1, where p is also prime.
- Primes q of the form q = 10p + 3, where p is also prime.A055782
Primes q of the form q = 10p + 3, where p is also prime.
- Primes q of form q=10p+7, where p is also prime.A055783
Primes q of form q=10p+7, where p is also prime.
- Primes q of form q = 10p + 9, where p is also prime.A055784
Primes q of form q = 10p + 9, where p is also prime.
- a(n) = smallest prime q of form q=-1+(p+1)*10^w, where p is n-th prime, or 0 if there is no such prime.A055785
a(n) = smallest prime q of form q=-1+(p+1)*10^w, where p is n-th prime, or 0 if there is no such prime.
- Numerators of Taylor series expansion of arcsin(x). Also arises from arccos(x), arccsc(x), arcsec(x), arcsinh(x).A055786
Numerators of Taylor series expansion of arcsin(x). Also arises from arccos(x), arccsc(x), arcsec(x), arcsinh(x).
- a(n) = 2^(4*n-1) - 2^(2*n-1)*binomial(2*n,n).A055787
a(n) = 2^(4*n-1) - 2^(2*n-1)*binomial(2*n,n).
- Number of symmetric types of (5,2n)-hypergraphs under action of complementing group C(5,2).A055788
Number of symmetric types of (5,2n)-hypergraphs under action of complementing group C(5,2).
- a(n) = binomial(n, round(sqrt(n))).A055789
a(n) = binomial(n, round(sqrt(n))).
- a(n) = n*a(n-1) + (n-2)*a(n-2), a(0) = 0, a(1) = 2.A055790
a(n) = n*a(n-1) + (n-2)*a(n-2), a(0) = 0, a(1) = 2.
- Table giving multiplicity of k-th irreducible character of Monster simple group in n-th head character, read by antidiagonals.A055791
Table giving multiplicity of k-th irreducible character of Monster simple group in n-th head character, read by antidiagonals.
- a(n) and floor(a(n)/2) are both squares; i.e., squares which remain squares when written in base 2 and last digit is removed.A055792
a(n) and floor(a(n)/2) are both squares; i.e., squares which remain squares when written in base 2 and last digit is removed.
- Numbers k such that k and floor[k/3] are both squares; i.e., squares which remain squares when written in base 3 and last digit is removed.A055793
Numbers k such that k and floor[k/3] are both squares; i.e., squares which remain squares when written in base 3 and last digit is removed.
- Triangle T read by rows: T(i,0)=1 for i >= 0; T(i,i)=1 for i=0,1,2,3; T(i,i)=0 for i >= 4; T(i,j) = T(i-1,j) + T(i-2,j-1) for 1<=j<=i-1.A055794
Triangle T read by rows: T(i,0)=1 for i >= 0; T(i,i)=1 for i=0,1,2,3; T(i,i)=0 for i >= 4; T(i,j) = T(i-1,j) + T(i-2,j-1) for 1<=j<=i-1.
- a(n) = binomial(n,4) + binomial(n,2).A055795
a(n) = binomial(n,4) + binomial(n,2).
- T(2n+3,n), array T as in A055794.A055796
T(2n+3,n), array T as in A055794.
- T(2n+4,n), array T as in A055794.A055797
T(2n+4,n), array T as in A055794.
- T(2n+5,n), array T as in A055794.A055798
T(2n+5,n), array T as in A055794.
- T(2n+6,n), array T as in A055794.A055799
T(2n+6,n), array T as in A055794.
- Triangle T read by rows: T(i,0)=1 for i >= 0; T(i,i)=0 for i >= 1; T(i,j) = Sum_{k=1..floor(i/2)} T(i-2k,j-2k+1) for 1 <= j <= i-1, where T(m,n) := 0 if m < 0 or n < 0.A055800
Triangle T read by rows: T(i,0)=1 for i >= 0; T(i,i)=0 for i >= 1; T(i,j) = Sum_{k=1..floor(i/2)} T(i-2k,j-2k+1) for 1 <= j <= i-1, where T(m,n) := 0 if m < 0 or n < 0.
- Triangle T read by rows: T(i,0)=T(i,i)=1, T(i,j) = Sum_{k=1..floor(n/2)} T(i-2k, j-2k+1) for 1<=j<=i-1, where T(m,n) := 0 if m<0 or n<0.A055801
Triangle T read by rows: T(i,0)=T(i,i)=1, T(i,j) = Sum_{k=1..floor(n/2)} T(i-2k, j-2k+1) for 1<=j<=i-1, where T(m,n) := 0 if m<0 or n<0.
- a(n) = T(n,n-2), array T as in A055801.A055802
a(n) = T(n,n-2), array T as in A055801.
- a(n) = T(n,n-3), array T as in A055801.A055803
a(n) = T(n,n-3), array T as in A055801.
- a(n) = T(n,n-4), array T as in A055801.A055804
a(n) = T(n,n-4), array T as in A055801.
- a(n) = T(n,n-5), array T as in A055801.A055805
a(n) = T(n,n-5), array T as in A055801.
- a(n) = T(n,n-6), array T as in A055801.A055806
a(n) = T(n,n-6), array T as in A055801.
- Triangle T read by rows: T(i,j) = R(i-j,j), where R(i,0) = 1 for i >= 0, R(0,j) = 0 for j >= 1, and R(i,j) = Sum_{h=0..i-1, k=0..j} R(h,k) for i >= 1 and j >= 1.A055807
Triangle T read by rows: T(i,j) = R(i-j,j), where R(i,0) = 1 for i >= 0, R(0,j) = 0 for j >= 1, and R(i,j) = Sum_{h=0..i-1, k=0..j} R(h,k) for i >= 1 and j >= 1.
- a(n) and floor(a(n)/4) are both squares; i.e., squares that remain squares when written in base 4 and last digit is removed.A055808
a(n) and floor(a(n)/4) are both squares; i.e., squares that remain squares when written in base 4 and last digit is removed.
- a(n) = T(n,n-4), array T as in A055807.A055809
a(n) = T(n,n-4), array T as in A055807.
- a(n) = T(n,n-5), array T as in A055807.A055810
a(n) = T(n,n-5), array T as in A055807.