Sequences
392,541 sequences
- Fifth column of triangle A075504.A076011
Fifth column of triangle A075504.
- Sixth column of triangle A075504.A076012
Sixth column of triangle A075504.
- Seventh column of triangle A075504.A076013
Seventh column of triangle A075504.
- Triangle in which m-th entry of n-th row is m^(n-1).A076014
Triangle in which m-th entry of n-th row is m^(n-1).
- Sum of the (n-1)-th powers of the first n integers.A076015
Sum of the (n-1)-th powers of the first n integers.
- Number of systems with n elements having one binary operation satisfying the equation B(AB)=A (semisymmetric quasigroups).A076016
Number of systems with n elements having one binary operation satisfying the equation B(AB)=A (semisymmetric quasigroups).
- Number of nonisomorphic systems with n elements with one binary operation satisfying the equation B(AB)=A (semisymmetric quasigroups).A076017
Number of nonisomorphic systems with n elements with one binary operation satisfying the equation B(AB)=A (semisymmetric quasigroups).
- Number of systems with n elements with one binary operation satisfying the equation B(AB)=A (semisymmetric quasigroups). Isomorphic systems and systems differing by a transposition have been omitted.A076018
Number of systems with n elements with one binary operation satisfying the equation B(AB)=A (semisymmetric quasigroups). Isomorphic systems and systems differing by a transposition have been omitted.
- Number of nonisomorphic commutative systems with n elements with one binary operation satisfying the equation B(AB)=A (totally-symmetric quasigroups).A076019
Number of nonisomorphic commutative systems with n elements with one binary operation satisfying the equation B(AB)=A (totally-symmetric quasigroups).
- Number of systems with n elements with one binary operation satisfying the equation B(AB)=A (semisymmetric quasigroups). This gives numbers of systems which are isomorphic to their transpose but are noncommutative.A076020
Number of systems with n elements with one binary operation satisfying the equation B(AB)=A (semisymmetric quasigroups). This gives numbers of systems which are isomorphic to their transpose but are noncommutative.
- Number of fully idempotent systems with n elements with one binary operation satisfying the equation B(AB)=A (idempotent semisymmetric quasigroups).A076021
Number of fully idempotent systems with n elements with one binary operation satisfying the equation B(AB)=A (idempotent semisymmetric quasigroups).
- Position of 2n in A073662.A076022
Position of 2n in A073662.
- Numbers n such that A076022(n)=n.A076023
Numbers n such that A076022(n)=n.
- a(n) = (2^n + 4)*(2^n - 1)/6.A076024
a(n) = (2^n + 4)*(2^n - 1)/6.
- Expansion of g.f.: (1-3*x*C)/(1-4*x*C) where C = (1 - sqrt(1-4*x))/(2*x) = g.f. for Catalan numbers A000108.A076025
Expansion of g.f.: (1-3*x*C)/(1-4*x*C) where C = (1 - sqrt(1-4*x))/(2*x) = g.f. for Catalan numbers A000108.
- Expansion of g.f.: (1-4*x*C)/(1-5*x*C) where C = (1/2-1/2*(1-4*x)^(1/2))/x = g.f. for Catalan numbers A000108.A076026
Expansion of g.f.: (1-4*x*C)/(1-5*x*C) where C = (1/2-1/2*(1-4*x)^(1/2))/x = g.f. for Catalan numbers A000108.
- Initial members of groups in A076031.A076027
Initial members of groups in A076031.
- Final members of groups in A076031.A076028
Final members of groups in A076031.
- Products of members of groups in A076031.A076029
Products of members of groups in A076031.
- Square roots of products of members of groups in A076031.A076030
Square roots of products of members of groups in A076031.
- Group the natural numbers so that the n-th group contains the smallest still-available set of n numbers whose product is a square.A076031
Group the natural numbers so that the n-th group contains the smallest still-available set of n numbers whose product is a square.
- Duplicate of A004277.A076032
Duplicate of A004277.
- Final members of groups in A076034.A076033
Final members of groups in A076034.
- Group the natural numbers so that the n-th group contains the smallest set of n relatively prime numbers: (1), (2, 3), (4, 5, 7), (6, 11, 13, 17), (8, 9, 19, 23, 25), (10, 21, 29, 31, 37, 41), ...A076034
Group the natural numbers so that the n-th group contains the smallest set of n relatively prime numbers: (1), (2, 3), (4, 5, 7), (6, 11, 13, 17), (8, 9, 19, 23, 25), (10, 21, 29, 31, 37, 41), ...
- Expansion of g.f. 1/(1-4*x*C) where C = (1/2-1/2*(1-4*x)^(1/2))/x = g.f. for Catalan numbers A000108.A076035
Expansion of g.f. 1/(1-4*x*C) where C = (1/2-1/2*(1-4*x)^(1/2))/x = g.f. for Catalan numbers A000108.
- G.f.: 1/(1 - 5*x*C(x)), where C(x) = (1 - sqrt(1 - 4*x))/(2*x) = g.f. for the Catalan numbers A000108.A076036
G.f.: 1/(1 - 5*x*C(x)), where C(x) = (1 - sqrt(1 - 4*x))/(2*x) = g.f. for the Catalan numbers A000108.
- Square array read by antidiagonals in which row n has g.f. (1-(n-1)*x*C)/(1-n*x*C) where C = (1/2-1/2*(1-4*x)^(1/2))/x = g.f. for Catalan numbers A000108.A076037
Square array read by antidiagonals in which row n has g.f. (1-(n-1)*x*C)/(1-n*x*C) where C = (1/2-1/2*(1-4*x)^(1/2))/x = g.f. for Catalan numbers A000108.
- Square array read by ascending antidiagonals in which row n has g.f. C/(1-n*x*C) where C = (1/2-1/2*(1-4*x)^(1/2))/x = g.f. for Catalan numbers A000108.A076038
Square array read by ascending antidiagonals in which row n has g.f. C/(1-n*x*C) where C = (1/2-1/2*(1-4*x)^(1/2))/x = g.f. for Catalan numbers A000108.
- Start with 1. Multiply or divide by n accordingly as a(n-1) is smaller or greater than n and then take the integer value (this is to ensure that a(n) > 0 for all n).A076039
Start with 1. Multiply or divide by n accordingly as a(n-1) is smaller or greater than n and then take the integer value (this is to ensure that a(n) > 0 for all n).
- a(n) = (-1)^n * (3^n - 1)/2.A076040
a(n) = (-1)^n * (3^n - 1)/2.
- a(n) = n! for n < 4; else a(n) = floor(P(n-1)/n) where P(n) = a(1) * a(2) * ... * a(n).A076041
a(n) = n! for n < 4; else a(n) = floor(P(n-1)/n) where P(n) = a(1) * a(2) * ... * a(n).
- a(0) = 0; thereafter a(n) = a(n-1) + n^2 if a(n-1) < n^2, otherwise a(n) = a(n-1) - n^2.A076042
a(0) = 0; thereafter a(n) = a(n-1) + n^2 if a(n-1) < n^2, otherwise a(n) = a(n-1) - n^2.
- a(1)=2; for n>1, a(n) is smallest squarefree number (greater than 1) not occurring earlier such that a(n) + a(n-1) is a square.A076043
a(1)=2; for n>1, a(n) is smallest squarefree number (greater than 1) not occurring earlier such that a(n) + a(n-1) is a square.
- Largest a(n) values with at most n primes between a(n) and a(n)+sqrt(a(n)) inclusive.A076044
Largest a(n) values with at most n primes between a(n) and a(n)+sqrt(a(n)) inclusive.
- Primes that are three term sums of A076990.A076045
Primes that are three term sums of A076990.
- Ramanujan-Nagell numbers: the triangular numbers (of the form a*(a+1)/2) which are also of the form 2^b - 1.A076046
Ramanujan-Nagell numbers: the triangular numbers (of the form a*(a+1)/2) which are also of the form 2^b - 1.
- Primes which are the difference between two successive nontrivial prime powers (A025475).A076047
Primes which are the difference between two successive nontrivial prime powers (A025475).
- Number of prime powers p^k (k != 1) <= 10^n.A076048
Number of prime powers p^k (k != 1) <= 10^n.
- Numbers k such that the sum of the k-th triangular number and (k+2)-nd triangular number is a triangular number.A076049
Numbers k such that the sum of the k-th triangular number and (k+2)-nd triangular number is a triangular number.
- Limiting sequence if we start with 2 and successively replace n with 2,3,4,...,n,n+1.A076050
Limiting sequence if we start with 2 and successively replace n with 2,3,4,...,n,n+1.
- Sum of product of odd numbers <= n and the product of even numbers <= n.A076051
Sum of product of odd numbers <= n and the product of even numbers <= n.
- Sum(k=1, n, A006460(k)).A076052
Sum(k=1, n, A006460(k)).
- Rearrangement of natural numbers such that the 2n-th partial sum is composite and (2n-1)-th partial sum is prime.A076053
Rearrangement of natural numbers such that the 2n-th partial sum is composite and (2n-1)-th partial sum is prime.
- a(n) = Sum_{k=1..n} A006513(k).A076054
a(n) = Sum_{k=1..n} A006513(k).
- Composite numbers which when read backwards are primes.A076055
Composite numbers which when read backwards are primes.
- Primes which when read backwards are composite numbers.A076056
Primes which when read backwards are composite numbers.
- Numbers k such that Sum_{j=1..k} A006513(j) = 3*k/2.A076057
Numbers k such that Sum_{j=1..k} A006513(j) = 3*k/2.
- First members of groups in A076062.A076058
First members of groups in A076062.
- Final members of groups in A076062.A076059
Final members of groups in A076062.
- Sums of members of groups in A076062.A076060
Sums of members of groups in A076062.