Sequences
392,541 sequences
- High-temperature coefficients for internal energy for spin-1/2 Ising model on b.c.c. lattice.A047711
High-temperature coefficients for internal energy for spin-1/2 Ising model on b.c.c. lattice.
- High-temperature coefficients for internal energy for spin-1/2 Ising model on f.c.c. lattice.A047712
High-temperature coefficients for internal energy for spin-1/2 Ising model on f.c.c. lattice.
- Euler-Jacobi pseudoprimes: 2^((n-1)/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol.A047713
Euler-Jacobi pseudoprimes: 2^((n-1)/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol.
- Sums of 3 but no fewer nonzero fourth powers.A047714
Sums of 3 but no fewer nonzero fourth powers.
- Numbers that are the sum of 4 but no fewer nonzero fourth powers.A047715
Numbers that are the sum of 4 but no fewer nonzero fourth powers.
- Sums of 5 but no fewer nonzero fourth powers.A047716
Sums of 5 but no fewer nonzero fourth powers.
- Numbers that are the sum of 6 but no fewer nonzero fourth powers.A047717
Numbers that are the sum of 6 but no fewer nonzero fourth powers.
- Numbers that are the sum of 7 but no fewer nonzero fourth powers.A047718
Numbers that are the sum of 7 but no fewer nonzero fourth powers.
- Numbers that are the sum of 8 but no fewer nonzero fourth powers.A047719
Numbers that are the sum of 8 but no fewer nonzero fourth powers.
- Numbers that are the sum of 9 but no fewer nonzero fourth powers.A047720
Numbers that are the sum of 9 but no fewer nonzero fourth powers.
- Sum of 10 but no fewer nonzero fourth powers.A047721
Sum of 10 but no fewer nonzero fourth powers.
- Sum of 11 but no fewer nonzero fourth powers.A047722
Sum of 11 but no fewer nonzero fourth powers.
- Sum of 12 but no fewer nonzero fourth powers.A047723
Sum of 12 but no fewer nonzero fourth powers.
- Sum of 13 nonzero fourth powers.A047724
Sum of 13 nonzero fourth powers.
- Sum of 14 nonzero fourth powers.A047725
Sum of 14 nonzero fourth powers.
- Number of different numbers that are formed by permuting digits of n.A047726
Number of different numbers that are formed by permuting digits of n.
- Average divisor is an integer (A003601) and the number is refactorable (A033950).A047727
Average divisor is an integer (A003601) and the number is refactorable (A033950).
- Intersection of A046985 and A033950: multiply perfect, refactorable numbers with integer average divisor dividing the number.A047728
Intersection of A046985 and A033950: multiply perfect, refactorable numbers with integer average divisor dividing the number.
- Number of score sequences in tournament with n players, when 3 points are awarded in each game.A047729
Number of score sequences in tournament with n players, when 3 points are awarded in each game.
- Number of score sequences in tournament with n players, when 4 points are awarded in each game.A047730
Number of score sequences in tournament with n players, when 4 points are awarded in each game.
- Number of score sequences in tournament with n players, when 5 points are awarded in each game.A047731
Number of score sequences in tournament with n players, when 5 points are awarded in each game.
- First differences are A005563.A047732
First differences are A005563.
- Number of score sequences in tournament with n players, when 6 points are awarded in each game.A047733
Number of score sequences in tournament with n players, when 6 points are awarded in each game.
- Number of score sequences in tournament with n players, when 7 points are awarded in each game.A047734
Number of score sequences in tournament with n players, when 7 points are awarded in each game.
- Number of score sequences in tournament with n players, when 8 points are awarded in each game.A047735
Number of score sequences in tournament with n players, when 8 points are awarded in each game.
- Number of score sequences in tournament with n players, when 9 points are awarded in each game.A047736
Number of score sequences in tournament with n players, when 9 points are awarded in each game.
- Number of score sequences in tournament with n players, when 10 points are awarded in each game.A047737
Number of score sequences in tournament with n players, when 10 points are awarded in each game.
- Earliest sequence of 4 consecutive economical numbers.A047738
Earliest sequence of 4 consecutive economical numbers.
- Economical palindromes.A047739
Economical palindromes.
- A discrete analog of Li(n): floor ( Sum_{k=2..n} 1/log_e (k) ).A047740
A discrete analog of Li(n): floor ( Sum_{k=2..n} 1/log_e (k) ).
- A discrete analog of Li(n): a(n) = round(Sum_{k=2..n} 1/log(k)).A047741
A discrete analog of Li(n): a(n) = round(Sum_{k=2..n} 1/log(k)).
- A discrete analog of Li(n): a(n) = ceiling(Sum_{k=2..n} 1/log(k)).A047742
A discrete analog of Li(n): a(n) = ceiling(Sum_{k=2..n} 1/log(k)).
- A discrete analog of Li(n): floor ( Sum_{k=2..n} 1/log_2 (k) ).A047743
A discrete analog of Li(n): floor ( Sum_{k=2..n} 1/log_2 (k) ).
- A discrete analog of Li(n): round ( Sum_{k=2..n} 1/log_2 (k) ).A047744
A discrete analog of Li(n): round ( Sum_{k=2..n} 1/log_2 (k) ).
- A discrete analog of Li(n): ceiling ( Sum_{k=2..n} 1/log_2 (k) ).A047745
A discrete analog of Li(n): ceiling ( Sum_{k=2..n} 1/log_2 (k) ).
- A discrete analog of Li(n): floor ( Sum_{k=2..n} 1/log_10 (k) ).A047746
A discrete analog of Li(n): floor ( Sum_{k=2..n} 1/log_10 (k) ).
- A discrete analog of Li(n): round ( Sum_{k=2..n} 1/log_10 (k) ).A047747
A discrete analog of Li(n): round ( Sum_{k=2..n} 1/log_10 (k) ).
- A discrete analog of Li(n): ceiling(Sum_{k=2..n} 1/log_10 (k)).A047748
A discrete analog of Li(n): ceiling(Sum_{k=2..n} 1/log_10 (k)).
- If n = 2*m then a(n) = binomial(3*m, m)/(2*m+1), if n=2*m+1 then a(n) = binomial(3*m+1, m+1)/(2*m+1).A047749
If n = 2*m then a(n) = binomial(3*m, m)/(2*m+1), if n=2*m+1 then a(n) = binomial(3*m+1, m+1)/(2*m+1).
- If n mod 2 = 0 then m := n/2 and a(n) = (3*m)!*(5*m+1)/((m+1)!*(2*m+1)!); otherwise m := (n-1)/2, a(n) = 6*(3*m+2)!/(m!*(2*m+3)!).A047750
If n mod 2 = 0 then m := n/2 and a(n) = (3*m)!*(5*m+1)/((m+1)!*(2*m+1)!); otherwise m := (n-1)/2, a(n) = 6*(3*m+2)!/(m!*(2*m+3)!).
- Number of dissectable polyhedra with n tetrahedral cells and symmetry of type K.A047751
Number of dissectable polyhedra with n tetrahedral cells and symmetry of type K.
- Number of chiral pairs of dissectable polyhedra with n tetrahedral cells and symmetry of type J.A047752
Number of chiral pairs of dissectable polyhedra with n tetrahedral cells and symmetry of type J.
- Number of dissectable polyhedra with n tetrahedral cells and symmetry of type I.A047753
Number of dissectable polyhedra with n tetrahedral cells and symmetry of type I.
- Number of dissectable polyhedra with n tetrahedral cells and symmetry of type H.A047754
Number of dissectable polyhedra with n tetrahedral cells and symmetry of type H.
- a(n) = A047752(12n+5).A047755
a(n) = A047752(12n+5).
- Duplicate of A047767.A047756
Duplicate of A047767.
- Duplicate of A047755.A047757
Duplicate of A047755.
- Number of chiral pairs of dissectable polyhedra with n tetrahedral cells and symmetry of type G.A047758
Number of chiral pairs of dissectable polyhedra with n tetrahedral cells and symmetry of type G.
- Duplicate of A047772.A047759
Duplicate of A047772.
- Number of dissectable polyhedra with n tetrahedral cells and symmetry of type F.A047760
Number of dissectable polyhedra with n tetrahedral cells and symmetry of type F.