Sequences
392,541 sequences
- Number of inequivalent optimal Hermitian formally self-dual but not self-dual codes of length 2n over GF(4).A082961
Number of inequivalent optimal Hermitian formally self-dual but not self-dual codes of length 2n over GF(4).
- Numerators of continued fraction convergents to (sqrt(37)-4)/3.A082962
Numerators of continued fraction convergents to (sqrt(37)-4)/3.
- Number of n X n 0-1 matrices with half 1's and half 0's (rounded up/down if odd).A082963
Number of n X n 0-1 matrices with half 1's and half 0's (rounded up/down if odd).
- a(n) = round(n/Pi), n divided by Pi rounded to the nearest integer.A082964
a(n) = round(n/Pi), n divided by Pi rounded to the nearest integer.
- a(n) = A000252(n) / A065558(n).A082965
a(n) = A000252(n) / A065558(n).
- Number of inequivalent ways (mod D_4) three checkers can be placed on an n X n board.A082966
Number of inequivalent ways (mod D_4) three checkers can be placed on an n X n board.
- Numbers n such that mu(n) + mu(n+1) + mu(n+2) + mu(n+3) + mu(n+4) + mu(n+5) + mu(n+6) = 6.A082967
Numbers n such that mu(n) + mu(n+1) + mu(n+2) + mu(n+3) + mu(n+4) + mu(n+5) + mu(n+6) = 6.
- a(n)=sum(k=1,n, k mod sum(i=0,k-1,1-t(i))) where t(i)=A010060(i) is the Thue-Morse sequence.A082968
a(n)=sum(k=1,n, k mod sum(i=0,k-1,1-t(i))) where t(i)=A010060(i) is the Thue-Morse sequence.
- Numbers n such that (n/4)^2-n/8 = Sum_{k=1..n} (k mod Sum_{i=0..k-1} 1-t(i)) where t(i)=A010060(i) is the Thue-Morse sequence.A082969
Numbers n such that (n/4)^2-n/8 = Sum_{k=1..n} (k mod Sum_{i=0..k-1} 1-t(i)) where t(i)=A010060(i) is the Thue-Morse sequence.
- Number of permutations of length n containing 2 occurrences of 132.A082970
Number of permutations of length n containing 2 occurrences of 132.
- Number of permutations of {1,2,...,n} containing exactly 3 occurrences of the 132 pattern.A082971
Number of permutations of {1,2,...,n} containing exactly 3 occurrences of the 132 pattern.
- Incorrect version of A082971.A082972
Incorrect version of A082971.
- Fibonacci numbers which are of the form Sum{i=1..k} prime(i) for some k.A082973
Fibonacci numbers which are of the form Sum{i=1..k} prime(i) for some k.
- a(n) = (a(n-1) + p(n)) mod p(n+1).A082974
a(n) = (a(n-1) + p(n)) mod p(n+1).
- Denominators of continued fraction convergents to (sqrt(37)-4)/3.A082975
Denominators of continued fraction convergents to (sqrt(37)-4)/3.
- Erroneous version of A036561.A082976
Erroneous version of A036561.
- Numbers that are congruent to {0, 1, 3, 5, 6, 8, 10} mod 12.A082977
Numbers that are congruent to {0, 1, 3, 5, 6, 8, 10} mod 12.
- Duplicate of A005536.A082978
Duplicate of A005536.
- Lexicographically earliest rearrangement of primes such that the sum of two consecutive terms is a palindrome.A082979
Lexicographically earliest rearrangement of primes such that the sum of two consecutive terms is a palindrome.
- Rearrangement of triangular numbers such that the sum of two consecutive terms is a palindrome.A082980
Rearrangement of triangular numbers such that the sum of two consecutive terms is a palindrome.
- Start with the sequence S(0)={1,1} and for k>0 define S(k) to be I(S(k-1)) where I denotes the operation of inserting, for i=1,2,3..., the term a(i)+a(i+1) between any two terms for which 4a(i+1)<=5a(i). The listed terms are the initial terms of the limit of this process as k goes to infinity.A082981
Start with the sequence S(0)={1,1} and for k>0 define S(k) to be I(S(k-1)) where I denotes the operation of inserting, for i=1,2,3..., the term a(i)+a(i+1) between any two terms for which 4a(i+1)<=5a(i). The listed terms are the initial terms of the limit of this process as k goes to infinity.
- Numbers k such that k, k+1 and k+2 are sums of 2 squares.A082982
Numbers k such that k, k+1 and k+2 are sums of 2 squares.
- Odd numbers which lead to 1 in the 3x+1 problem, generated by a particular "least-first" greedy algorithm (see program code).A082983
Odd numbers which lead to 1 in the 3x+1 problem, generated by a particular "least-first" greedy algorithm (see program code).
- Numbers k for which the 3x+1 problem takes at least k halving and tripling steps to reach 1.A082984
Numbers k for which the 3x+1 problem takes at least k halving and tripling steps to reach 1.
- Coefficient table for Chebyshev's U(2*n,x) polynomial expanded in decreasing powers of (-4*(1-x^2)).A082985
Coefficient table for Chebyshev's U(2*n,x) polynomial expanded in decreasing powers of (-4*(1-x^2)).
- Largest x such that 1/x + 1/y + 1/z = 1/n.A082986
Largest x such that 1/x + 1/y + 1/z = 1/n.
- a(n) = Sum_{k=0..n} 3^k*F(k) where F(k) is the k-th Fibonacci number.A082987
a(n) = Sum_{k=0..n} 3^k*F(k) where F(k) is the k-th Fibonacci number.
- a(n) = Sum_{k=0..n} 4^k*F(k) where F(k) is the k-th Fibonacci number.A082988
a(n) = Sum_{k=0..n} 4^k*F(k) where F(k) is the k-th Fibonacci number.
- Number of ordered trees with n edges and having no root-to-leaf branches.A082989
Number of ordered trees with n edges and having no root-to-leaf branches.
- Rent due for landing on undeveloped Monopoly properties starting at Mediterranean Avenue and finishing at Boardwalk, not including railroads or utilities.A082990
Rent due for landing on undeveloped Monopoly properties starting at Mediterranean Avenue and finishing at Boardwalk, not including railroads or utilities.
- a(1) = 1 and for n > 1, a(n) = 2 * length of the cycle reached for the map x -> A062401(x), starting at n [where A062401(n) = phi(sigma(n))], or -1 if no finite cycle is ever reached.A082991
a(1) = 1 and for n > 1, a(n) = 2 * length of the cycle reached for the map x -> A062401(x), starting at n [where A062401(n) = phi(sigma(n))], or -1 if no finite cycle is ever reached.
- Primes whose 10's complement is a triangular number.A082992
Primes whose 10's complement is a triangular number.
- a(1) = 2; a(n+1) = least prime > a(1)*a(2)*...*a(n).A082993
a(1) = 2; a(n+1) = least prime > a(1)*a(2)*...*a(n).
- Numbers k such that all the following properties hold: (i) k*reverse(k) is a square; (ii) k != reverse(k); (iii) k and reverse(k) are not both squares; and (iv) k and reverse(k) have the same number of digits.A082994
Numbers k such that all the following properties hold: (i) k*reverse(k) is a square; (ii) k != reverse(k); (iii) k and reverse(k) are not both squares; and (iv) k and reverse(k) have the same number of digits.
- Distance from n!+1 to next larger square.A082995
Distance from n!+1 to next larger square.
- a(n) = card{ x <= n : bigomega(x) = 4 }.A082996
a(n) = card{ x <= n : bigomega(x) = 4 }.
- a(n) = card{ x <= n : omega(x) = 2 }.A082997
a(n) = card{ x <= n : omega(x) = 2 }.
- a(n) = card{ x <= n : omega(x) = 3 }.A082998
a(n) = card{ x <= n : omega(x) = 3 }.
- a(n) = A046195(n) mod 5.A082999
a(n) = A046195(n) mod 5.
- Values of x for which 9*y^2 = x^2 + 2*x*y - 2*x has integer solutions with positive y.A083000
Values of x for which 9*y^2 = x^2 + 2*x*y - 2*x has integer solutions with positive y.
- Smallest oblong number having n prime divisors (with multiplicity).A083001
Smallest oblong number having n prime divisors (with multiplicity).
- Smallest oblong number having at least n distinct prime divisors.A083002
Smallest oblong number having at least n distinct prime divisors.
- Triangle read by rows in which each term represents the total area of all the squares found in the grid described in sequence A082652.A083003
Triangle read by rows in which each term represents the total area of all the squares found in the grid described in sequence A082652.
- Primes whose 10's complement is a square.A083004
Primes whose 10's complement is a square.
- a(1)=1, a(n)=2a(n-1)+1 if a(n-1) is prime, a(n)=a(n-1)+1 otherwise.A083005
a(1)=1, a(n)=2a(n-1)+1 if a(n-1) is prime, a(n)=a(n-1)+1 otherwise.
- Numbers k such that Sum_{j=0..k-1} Bernoulli(j)*binomial(k,j)^2 is an integer.A083006
Numbers k such that Sum_{j=0..k-1} Bernoulli(j)*binomial(k,j)^2 is an integer.
- a(n) = Sum_{k=0..n-1} 3^k*B(k)*C(n,k) where B(k) is the k-th Bernoulli number and C(n,k)=binomial(n,k).A083007
a(n) = Sum_{k=0..n-1} 3^k*B(k)*C(n,k) where B(k) is the k-th Bernoulli number and C(n,k)=binomial(n,k).
- a(n) = Sum_{k=0..n-1} 4^k*B(k)*C(n,k) where B(k) is the k-th Bernoulli number and C(n,k) = binomial(n,k).A083008
a(n) = Sum_{k=0..n-1} 4^k*B(k)*C(n,k) where B(k) is the k-th Bernoulli number and C(n,k) = binomial(n,k).
- a(n) = Sum_{k=0,n-1} 5^k*B(k)*binomial(n,k) where B(k) is the k-th Bernoulli number.A083009
a(n) = Sum_{k=0,n-1} 5^k*B(k)*binomial(n,k) where B(k) is the k-th Bernoulli number.
- a(n) = 6^n(B_n(1/6)-B_n(0)) where B_n(x) is the n-th Bernoulli polynomial.A083010
a(n) = 6^n(B_n(1/6)-B_n(0)) where B_n(x) is the n-th Bernoulli polynomial.