Sequences
392,541 sequences
- Numbers m such that Stern's diatomic A002487(m) is divisible by 3.A071911
Numbers m such that Stern's diatomic A002487(m) is divisible by 3.
- a(0) = 0, a(1) = 1; to get a(n+1) for n >= 1, let m = a(n) and consider in turn the numbers k = m-1, m-2, ..., 2, 1, m+1, m+2, m+3, ... until reach a k such that gcd(m,k) = 1 and m/k is different from all a(i)/a(i+1) for i = 0, ..., n-1.A071912
a(0) = 0, a(1) = 1; to get a(n+1) for n >= 1, let m = a(n) and consider in turn the numbers k = m-1, m-2, ..., 2, 1, m+1, m+2, m+3, ... until reach a k such that gcd(m,k) = 1 and m/k is different from all a(i)/a(i+1) for i = 0, ..., n-1.
- Smallest k such that A069624(k) = n.A071913
Smallest k such that A069624(k) = n.
- Numbers n of the form k + reverse(k) for exactly three k.A071914
Numbers n of the form k + reverse(k) for exactly three k.
- Number of 1's in the continued fraction expansion of (3/2)^n.A071915
Number of 1's in the continued fraction expansion of (3/2)^n.
- Primes p such that the number of ones in the binary representation of p! is prime.A071916
Primes p such that the number of ones in the binary representation of p! is prime.
- Number of pairs (x,y) where x is even, y is odd, 1<=x<=n, 1<=y<=n and x+y is prime.A071917
Number of pairs (x,y) where x is even, y is odd, 1<=x<=n, 1<=y<=n and x+y is prime.
- First appearance in the decimal expansion of Pi of the first n digits of the decimal expansion of e.A071918
First appearance in the decimal expansion of Pi of the first n digits of the decimal expansion of e.
- Number of monotone nondecreasing functions [n]->[m] for n >= 0, m >= 0, read by antidiagonals.A071919
Number of monotone nondecreasing functions [n]->[m] for n >= 0, m >= 0, read by antidiagonals.
- Square array giving number of unimodal functions [n]->[m] for n>=0, m>=0, with a(0,m)=0 for all m>=0, read by antidiagonals.A071920
Square array giving number of unimodal functions [n]->[m] for n>=0, m>=0, with a(0,m)=0 for all m>=0, read by antidiagonals.
- Square array giving number of unimodal functions [n]->[m] for n>=0, m>=0, with a(0,m)=1 by definition, read by antidiagonals.A071921
Square array giving number of unimodal functions [n]->[m] for n>=0, m>=0, with a(0,m)=1 by definition, read by antidiagonals.
- Unimodal analog of binomial coefficient, such that A071921(n,m) = a(n+m-1,n) for all (n,m) different from (0,0), arranged in a Pascal-like triangle.A071922
Unimodal analog of binomial coefficient, such that A071921(n,m) = a(n+m-1,n) for all (n,m) different from (0,0), arranged in a Pascal-like triangle.
- a(n) is the prime p such that pi(n^2, (n+1)^2+1) = pi((n+1)^2, p) where pi(s,t) = pi(t) - pi(s) is the number of primes between s and t.A071923
a(n) is the prime p such that pi(n^2, (n+1)^2+1) = pi((n+1)^2, p) where pi(s,t) = pi(t) - pi(s) is the number of primes between s and t.
- Highest m such that prime(m) divides the n-th pandigital (A050278).A071924
Highest m such that prime(m) divides the n-th pandigital (A050278).
- Digitally balanced numbers: binary numbers which have the same number of 0's as 1's; decimal representation: A031443.A071925
Digitally balanced numbers: binary numbers which have the same number of 0's as 1's; decimal representation: A031443.
- Least m such that m-th pandigital A050278(m) is a multiple of n or -1 if no such m exists.A071926
Least m such that m-th pandigital A050278(m) is a multiple of n or -1 if no such m exists.
- Barely abundant numbers: abundant n such that sigma(n)/n < sigma(m)/m for all abundant numbers m<n, sigma(n) being the sum of the divisors of n.A071927
Barely abundant numbers: abundant n such that sigma(n)/n < sigma(m)/m for all abundant numbers m<n, sigma(n) being the sum of the divisors of n.
- Kolakoski-(2,4) sequence: a(n) is length of n-th run.A071928
Kolakoski-(2,4) sequence: a(n) is length of n-th run.
- Numbers k such that the sum of exponents of k is equal to the greatest prime factor of k; a(1)=1.A071929
Numbers k such that the sum of exponents of k is equal to the greatest prime factor of k; a(1)=1.
- Number of words of length 2n in the two letters s and t that reduce to the identity 1 by using the relations ssTT=1, ststSS=1 and ststTT=1, where S and T are the inverses of s and t, respectively (i.e., sS=1 and tT=1). The generators s and t and the three stated relations generate the quaternion group Q4.A071930
Number of words of length 2n in the two letters s and t that reduce to the identity 1 by using the relations ssTT=1, ststSS=1 and ststTT=1, where S and T are the inverses of s and t, respectively (i.e., sS=1 and tT=1). The generators s and t and the three stated relations generate the quaternion group Q4.
- Non-Størmer numbers whose largest prime factor is a Størmer number.A071931
Non-Størmer numbers whose largest prime factor is a Størmer number.
- a(n) = 4*Sum_{i=1..n} K(i,i+1) - n, where K(x,y) is the Kronecker symbol (x/y).A071932
a(n) = 4*Sum_{i=1..n} K(i,i+1) - n, where K(x,y) is the Kronecker symbol (x/y).
- a(n) = Sum_{i=1..n} K(i,i+1), where K(x,y) is the Kronecker symbol (x/y).A071933
a(n) = Sum_{i=1..n} K(i,i+1), where K(x,y) is the Kronecker symbol (x/y).
- a(n) = Sum_{i=1..n} K(i+1,i), where K(x,y) is the Kronecker symbol (x/y).A071934
a(n) = Sum_{i=1..n} K(i+1,i), where K(x,y) is the Kronecker symbol (x/y).
- K(n,n+1) where K(x,y) is the Kronecker symbol (x/y).A071935
K(n,n+1) where K(x,y) is the Kronecker symbol (x/y).
- K(n+1,n) where K(x,y) is the Kronecker symbol (x/y).A071936
K(n+1,n) where K(x,y) is the Kronecker symbol (x/y).
- Reverse(n)!.A071937
Reverse(n)!.
- Binomial(max(n,R(n)),min(n,R(n))) where R(n) is the reversal of n.A071938
Binomial(max(n,R(n)),min(n,R(n))) where R(n) is the reversal of n.
- a(n) = Max { sigma(k) : k = 1, 2, 3, ..., n } - Max { Phi(k) : k = 1, 2, 3, ..., n }.A071939
a(n) = Max { sigma(k) : k = 1, 2, 3, ..., n } - Max { Phi(k) : k = 1, 2, 3, ..., n }.
- Number of 1's among the first n terms of the simple continued fraction for Pi.A071940
Number of 1's among the first n terms of the simple continued fraction for Pi.
- Nonprimes for which floor(2^n/n) is even.A071941
Nonprimes for which floor(2^n/n) is even.
- Kolakoski-(3,4) sequence: a(n) is length of n-th run.A071942
Kolakoski-(3,4) sequence: a(n) is length of n-th run.
- Triangle T(n,k) (n>=0, 0 <= k <= n) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using only steps R=(1,0), V=(0,1) and D=(1,2).A071943
Triangle T(n,k) (n>=0, 0 <= k <= n) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using only steps R=(1,0), V=(0,1) and D=(1,2).
- Triangle read by rows giving numbers of paths in a lattice satisfying certain conditions.A071944
Triangle read by rows giving numbers of paths in a lattice satisfying certain conditions.
- Triangle T(n,k) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using steps R=(1,0), V=(0,1) and D=(2,1).A071945
Triangle T(n,k) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using steps R=(1,0), V=(0,1) and D=(2,1).
- Triangle T(n,k) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using only steps R = (1,0), V = (0,1) and D = (3,1).A071946
Triangle T(n,k) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using only steps R = (1,0), V = (0,1) and D = (3,1).
- Triangle read by rows of numbers of paths in a lattice satisfying certain conditions.A071947
Triangle read by rows of numbers of paths in a lattice satisfying certain conditions.
- Triangle read by rows of numbers of paths in a lattice satisfying certain conditions.A071948
Triangle read by rows of numbers of paths in a lattice satisfying certain conditions.
- Triangle read by rows of numbers of paths in a lattice satisfying certain conditions.A071949
Triangle read by rows of numbers of paths in a lattice satisfying certain conditions.
- Triangle read by rows of numbers of paths in a lattice satisfying certain conditions.A071950
Triangle read by rows of numbers of paths in a lattice satisfying certain conditions.
- Triangle of Legendre-Stirling numbers of the second kind T(n,j), n >= 1, 1 <= j <= n, read by rows.A071951
Triangle of Legendre-Stirling numbers of the second kind T(n,j), n >= 1, 1 <= j <= n, read by rows.
- Diagonal T(n, 4) of triangle in A071951.A071952
Diagonal T(n, 4) of triangle in A071951.
- Diagonal T(n,n-2) of triangle in A071951.A071953
Diagonal T(n,n-2) of triangle in A071951.
- a(n) = 4*a(n-1) - a(n-2) - 4, with a(0) = 2, a(1) = 4.A071954
a(n) = 4*a(n-1) - a(n-2) - 4, with a(0) = 2, a(1) = 4.
- a(n) = remainder when n is reduced mod reverse(n).A071955
a(n) = remainder when n is reduced mod reverse(n).
- Table in which n-th row list prime factors and their exponents in factorization of prime(n)!.A071956
Table in which n-th row list prime factors and their exponents in factorization of prime(n)!.
- Sum( i=1, n, K(i,n) ) where K(x,y) is the Kronecker symbol (x/y).A071957
Sum( i=1, n, K(i,n) ) where K(x,y) is the Kronecker symbol (x/y).
- Numbers k such that Sum_{i=0..k} K(k, i) < 0 where K(x, y) is the Kronecker symbol (x/y).A071958
Numbers k such that Sum_{i=0..k} K(k, i) < 0 where K(x, y) is the Kronecker symbol (x/y).
- Numbers m such that Sum_{i=1..m} K(i,m) = Sum_{i=1..m} K(m,i) where K(x,y) is the Kronecker symbol (x/y).A071959
Numbers m such that Sum_{i=1..m} K(i,m) = Sum_{i=1..m} K(m,i) where K(x,y) is the Kronecker symbol (x/y).
- Largest k >= 0 such that Product_{i=0..k} (n+i) divides n!.A071960
Largest k >= 0 such that Product_{i=0..k} (n+i) divides n!.