Sequences
392,541 sequences
- a(n) = binomial(n!,(n-1)!).A080911
a(n) = binomial(n!,(n-1)!).
- a(n) = first number that appears n times in A080900.A080912
a(n) = first number that appears n times in A080900.
- Value of index in A080900 when a number first appears for the n-th time.A080913
Value of index in A080900 when a number first appears for the n-th time.
- A080900 sorted and duplicates removed.A080914
A080900 sorted and duplicates removed.
- Number of electrons in outermost electron shell (valence electrons) in chemical element number n.A080915
Number of electrons in outermost electron shell (valence electrons) in chemical element number n.
- Number of electrons in outermost electron subshell in chemical element number n.A080916
Number of electrons in outermost electron subshell in chemical element number n.
- Number of integer solutions to the equation 2*x^2 + y^2 + 8*z^2 = n.A080917
Number of integer solutions to the equation 2*x^2 + y^2 + 8*z^2 = n.
- Number of integer solutions to the equation 2x^2+y^2+32z^2=n.A080918
Number of integer solutions to the equation 2x^2+y^2+32z^2=n.
- Numbers that do not appear in A080900.A080919
Numbers that do not appear in A080900.
- a(n) = 2*a(n-1) + 35*a(n-2), a(0) = 0, a(1) = 1.A080920
a(n) = 2*a(n-1) + 35*a(n-2), a(0) = 0, a(1) = 1.
- a(n) = 2*a(n-1) + 48*a(n-2), a(0)=0, a(1)=1.A080921
a(n) = 2*a(n-1) + 48*a(n-2), a(0)=0, a(1)=1.
- Records in A080905.A080922
Records in A080905.
- First differences of A003946.A080923
First differences of A003946.
- Jacobsthal gap sequence.A080924
Jacobsthal gap sequence.
- Binomial transform of Jacobsthal gap sequence (A080924).A080925
Binomial transform of Jacobsthal gap sequence (A080924).
- Partial sums of A080925.A080926
Partial sums of A080925.
- Where records occur in A080905 (endpoints of record runs).A080927
Where records occur in A080905 (endpoints of record runs).
- Triangle T(n,k) read by rows: T(n,k) = Sum_{i=0..n} C(n,2i)*C(2i,k).A080928
Triangle T(n,k) read by rows: T(n,k) = Sum_{i=0..n} C(n,2i)*C(2i,k).
- Sequence associated with a(n) = 2*a(n-1) + k*(k+2)*a(n-2).A080929
Sequence associated with a(n) = 2*a(n-1) + k*(k+2)*a(n-2).
- a(n) = 2^(n-3)*(n+2)*(n+3)*(n+4)/3.A080930
a(n) = 2^(n-3)*(n+2)*(n+3)*(n+4)/3.
- Record-setting differences between adjacent elements of the Mian-Chowla sequence variant A058335.A080931
Record-setting differences between adjacent elements of the Mian-Chowla sequence variant A058335.
- Non-occurring pairwise differences between the elements of the Mian-Chowla sequence variant A058335.A080932
Non-occurring pairwise differences between the elements of the Mian-Chowla sequence variant A058335.
- Smallest non-occurring pairwise difference between the elements of a Mian-Chowla sequence (A005282) variant starting with (1,n).A080933
Smallest non-occurring pairwise difference between the elements of a Mian-Chowla sequence (A005282) variant starting with (1,n).
- Square array read by antidiagonals of number of Catalan paths (nonnegative, starting and ending at 0, step +-1) of 2n steps with all values less than or equal to k.A080934
Square array read by antidiagonals of number of Catalan paths (nonnegative, starting and ending at 0, step +-1) of 2n steps with all values less than or equal to k.
- Triangle read by rows of number of Catalan paths (nonnegative, starting and ending at 0, step +/-1) of 2n steps with all values less than or equal to k.A080935
Triangle read by rows of number of Catalan paths (nonnegative, starting and ending at 0, step +/-1) of 2n steps with all values less than or equal to k.
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and height k (1 <= k <= n).A080936
Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and height k (1 <= k <= n).
- Number of Catalan paths (nonnegative, starting and ending at 0, step +/-1) of 2*n steps with all values <= 5.A080937
Number of Catalan paths (nonnegative, starting and ending at 0, step +/-1) of 2*n steps with all values <= 5.
- Number of Catalan paths (nonnegative, starting and ending at 0, step +-1) of 2*n steps with all values less than or equal to 7.A080938
Number of Catalan paths (nonnegative, starting and ending at 0, step +-1) of 2*n steps with all values less than or equal to 7.
- a(1)=3; for n>1, a(n)=a(n-1)-2 if n is already in the sequence, a(n)=a(n-1)+5 otherwise.A080939
a(1)=3; for n>1, a(n)=a(n-1)-2 if n is already in the sequence, a(n)=a(n-1)+5 otherwise.
- Smallest proper divisor of n which is a suffix of n in binary representation; a(n) = 0 if no such divisor exists.A080940
Smallest proper divisor of n which is a suffix of n in binary representation; a(n) = 0 if no such divisor exists.
- Greatest proper divisor of n which is a suffix of n in binary representation; a(n) = 0 if no such divisor exists.A080941
Greatest proper divisor of n which is a suffix of n in binary representation; a(n) = 0 if no such divisor exists.
- Number of divisors of n that are also suffixes of n in binary representation.A080942
Number of divisors of n that are also suffixes of n in binary representation.
- Numbers having exactly two divisors that are also suffixes in binary representation.A080943
Numbers having exactly two divisors that are also suffixes in binary representation.
- Numbers having only trivial divisors that are also suffixes in binary representation.A080944
Numbers having only trivial divisors that are also suffixes in binary representation.
- Numbers having more than two divisors that are also suffixes in binary representation.A080945
Numbers having more than two divisors that are also suffixes in binary representation.
- Numbers having exactly three divisors that are also suffixes in binary representation.A080946
Numbers having exactly three divisors that are also suffixes in binary representation.
- Numbers having more than three divisors that are also suffixes in binary representation.A080947
Numbers having more than three divisors that are also suffixes in binary representation.
- Least number m having n divisors that are also suffixes of m in binary representation.A080948
Least number m having n divisors that are also suffixes of m in binary representation.
- a(1)=0; for n>1, a(n)=a(n-1)-2 if n is already in the sequence, a(n)=a(n-1)+5 otherwise.A080949
a(1)=0; for n>1, a(n)=a(n-1)-2 if n is already in the sequence, a(n)=a(n-1)+5 otherwise.
- Number of numbers that differ from n in binary representation by exactly one edit-operation: deletion, insertion, or substitution.A080950
Number of numbers that differ from n in binary representation by exactly one edit-operation: deletion, insertion, or substitution.
- Sequence associated with recurrence a(n) = 2*a(n-1) + k*(k+2)*a(n-2).A080951
Sequence associated with recurrence a(n) = 2*a(n-1) + k*(k+2)*a(n-2).
- a(n) = 2^(n-4)*(n+2)*(n+3)*(n+4)*(n+5)*(n+6)/15.A080952
a(n) = 2^(n-4)*(n+2)*(n+3)*(n+4)*(n+5)*(n+6)/15.
- Weight distribution of [151,76,19] binary quadratic-residue (or QR) code.A080953
Weight distribution of [151,76,19] binary quadratic-residue (or QR) code.
- E.g.f. exp(5x)/(1-x).A080954
E.g.f. exp(5x)/(1-x).
- Square array of numbers related to the incomplete gamma function, read by antidiagonals.A080955
Square array of numbers related to the incomplete gamma function, read by antidiagonals.
- a(n) = (n+1)*(2-n)/2.A080956
a(n) = (n+1)*(2-n)/2.
- Expansion of (5 - 9*x + 6*x^2)/(1-x)^4.A080957
Expansion of (5 - 9*x + 6*x^2)/(1-x)^4.
- a(n) = n!*(2/1 - 3/2 + 4/3 - ... + s*(n+1)/n), where s = (-1)^(n+1).A080958
a(n) = n!*(2/1 - 3/2 + 4/3 - ... + s*(n+1)/n), where s = (-1)^(n+1).
- Square array of coefficients of binomial polynomials, read by antidiagonals.A080959
Square array of coefficients of binomial polynomials, read by antidiagonals.
- Third binomial transform of A010685 (period 2: repeat 1,4).A080960
Third binomial transform of A010685 (period 2: repeat 1,4).