Sequences
392,541 sequences
- Dealing cards in a game of solitaire.A071761
Dealing cards in a game of solitaire.
- Leftmost 1 is converted to a 2, which then propagates one step at a time until it is rightmost; then it changes to a pair of 1's and the process repeats.A071762
Leftmost 1 is converted to a 2, which then propagates one step at a time until it is rightmost; then it changes to a pair of 1's and the process repeats.
- Number of spanning trees in n X n X n grid.A071763
Number of spanning trees in n X n X n grid.
- Number of minimal rectangular envelopes (up to rotation) that enclose n contiguous squares.A071764
Number of minimal rectangular envelopes (up to rotation) that enclose n contiguous squares.
- Number of n-tuples of elements e_1,e_2,...,e_n in the alternating group A_4 such that the subgroup generated by e_1,e_2,...,e_n is A_4.A071765
Number of n-tuples of elements e_1,e_2,...,e_n in the alternating group A_4 such that the subgroup generated by e_1,e_2,...,e_n is A_4.
- Denominator of the continued fraction expansion whose terms are the first-order differences of exponents in the binary representation of 4n, with the exponents of 2 being listed in descending order.A071766
Denominator of the continued fraction expansion whose terms are the first-order differences of exponents in the binary representation of 4n, with the exponents of 2 being listed in descending order.
- Numbers n such that sigma(n) and d(n) are both harmonic (Ore) numbers.A071767
Numbers n such that sigma(n) and d(n) are both harmonic (Ore) numbers.
- Determinant of the n X n matrix whose element (i,j) equals |i-j| (Mod 3).A071768
Determinant of the n X n matrix whose element (i,j) equals |i-j| (Mod 3).
- Determinant of the n X n matrix whose element (i,j) equals |i-j| (mod 4).A071769
Determinant of the n X n matrix whose element (i,j) equals |i-j| (mod 4).
- Tersum n + [n/3] (answer recorded in base 10).A071770
Tersum n + [n/3] (answer recorded in base 10).
- Least k > 0 such that the nextprime(k*primorial(n)) - k*primorial(n) is composite.A071771
Least k > 0 such that the nextprime(k*primorial(n)) - k*primorial(n) is composite.
- Absolute values of the numerator of B(prime(n)-1) where B(k) are the Bernoulli numbers.A071772
Absolute values of the numerator of B(prime(n)-1) where B(k) are the Bernoulli numbers.
- a(n) = gcd(rad(n), n/rad(n)), where rad(n) = A007947(n) is the squarefree kernel of n.A071773
a(n) = gcd(rad(n), n/rad(n)), where rad(n) = A007947(n) is the squarefree kernel of n.
- Related to Pisano periods: integers k such that the period of Fibonacci numbers mod k equals 2*(k+1).A071774
Related to Pisano periods: integers k such that the period of Fibonacci numbers mod k equals 2*(k+1).
- Continued fraction for C = 0.23571379....the concatenation of final decimal digits of primes.A071775
Continued fraction for C = 0.23571379....the concatenation of final decimal digits of primes.
- Related to Pisano periods: n such that the period of Fibonacci numbers mod n equals 3*(n+2).A071776
Related to Pisano periods: n such that the period of Fibonacci numbers mod n equals 3*(n+2).
- Prime(n) divides F(n)-1 where F(n) are the Fibonacci numbers.A071777
Prime(n) divides F(n)-1 where F(n) are the Fibonacci numbers.
- Number of ordered triples (a, b, c) with gcd(a, b, c) = 1 and 1 <= {a, b, c} <= n.A071778
Number of ordered triples (a, b, c) with gcd(a, b, c) = 1 and 1 <= {a, b, c} <= n.
- Smallest k > n such that F(n) + F(i) divides F(k) + F(i) 1<=i<=n and where F(n) are the Fibonacci numbers.A071779
Smallest k > n such that F(n) + F(i) divides F(k) + F(i) 1<=i<=n and where F(n) are the Fibonacci numbers.
- Smallest k > n such that there are exactly n pairs (x,y) (1 <= x <= y <= k) solutions of the equation: phi(xy)=sigma(x)+sigma(y).A071780
Smallest k > n such that there are exactly n pairs (x,y) (1 <= x <= y <= k) solutions of the equation: phi(xy)=sigma(x)+sigma(y).
- Primes p with p-2^e and p+2^e prime for some exponent e.A071781
Primes p with p-2^e and p+2^e prime for some exponent e.
- Sum of distinct squares in Z_n (mod n).A071782
Sum of distinct squares in Z_n (mod n).
- Palindromic primes with at least one zero digit.A071783
Palindromic primes with at least one zero digit.
- Determinant of the n X n matrix whose element (i,j) equals the floor( Phi^(i-j) + 1).A071784
Determinant of the n X n matrix whose element (i,j) equals the floor( Phi^(i-j) + 1).
- In prime factorization of n replace each prime with the sum of its decimal digits.A071785
In prime factorization of n replace each prime with the sum of its decimal digits.
- In prime factorization of n replace each prime with its reversal (in decimal notation).A071786
In prime factorization of n replace each prime with its reversal (in decimal notation).
- Continued exponent expansion of the power series 1/(1-x); odd terms being numerators and even terms being denominators of the rational terms of the expansion: 1/(1-x) = e^[(a(1)/a(2))*x*e^[(a(3)/a(4))*x*e^[(a(5)/a(6))*x*e^[...]]]].A071787
Continued exponent expansion of the power series 1/(1-x); odd terms being numerators and even terms being denominators of the rational terms of the expansion: 1/(1-x) = e^[(a(1)/a(2))*x*e^[(a(3)/a(4))*x*e^[(a(5)/a(6))*x*e^[...]]]].
- Integer quotients arising in A071687.A071788
Integer quotients arising in A071687.
- Decimal expansion of the first (of 10) decimal selvage numbers; the n-th digit of a decimal selvage number, x, is equal to the tenths digit of n*x.A071789
Decimal expansion of the first (of 10) decimal selvage numbers; the n-th digit of a decimal selvage number, x, is equal to the tenths digit of n*x.
- Decimal expansion of the second (of 10) decimal selvage numbers; the n-th digit of a decimal selvage number, x, is equal to the tenths digit of n*x.A071790
Decimal expansion of the second (of 10) decimal selvage numbers; the n-th digit of a decimal selvage number, x, is equal to the tenths digit of n*x.
- Decimal expansion of the third (of 10) decimal selvage numbers; the n-th digit of a decimal selvage number, x, is equal to the tenths digit of n*x.A071791
Decimal expansion of the third (of 10) decimal selvage numbers; the n-th digit of a decimal selvage number, x, is equal to the tenths digit of n*x.
- Decimal expansion of the fourth (of 10) decimal selvage number; the n-th digit of a decimal selvage number, x, is equal to the tenths digit of n*x.A071792
Decimal expansion of the fourth (of 10) decimal selvage number; the n-th digit of a decimal selvage number, x, is equal to the tenths digit of n*x.
- Decimal expansion of the fifth (of 10) decimal selvage number; the n-th digit of a decimal selvage number, x, is equal to the tenths digit of n*x.A071793
Decimal expansion of the fifth (of 10) decimal selvage number; the n-th digit of a decimal selvage number, x, is equal to the tenths digit of n*x.
- a(n) is the smallest integer > 0 that cannot be obtained from the integers {1, ..., n} using each number at most once and the operators +, -, *, /, ^.A071794
a(n) is the smallest integer > 0 that cannot be obtained from the integers {1, ..., n} using each number at most once and the operators +, -, *, /, ^.
- Numerators of a(n+1) = Sum_{k=1..n} a'(n/k), a(1)=1, where a'(x)=a(x) if x integer and is linearly interpolated otherwise.A071795
Numerators of a(n+1) = Sum_{k=1..n} a'(n/k), a(1)=1, where a'(x)=a(x) if x integer and is linearly interpolated otherwise.
- Denominators of a(n+1) = Sum_{k=1..n} a'(n/k), a(1)=1, where a'(x)=a(x) if x integer and is linearly interpolated otherwise.A071796
Denominators of a(n+1) = Sum_{k=1..n} a'(n/k), a(1)=1, where a'(x)=a(x) if x integer and is linearly interpolated otherwise.
- Restart counting after each new odd integer (a fractal sequence).A071797
Restart counting after each new odd integer (a fractal sequence).
- Number of paths on the surface of the n-dimensional lattice [0..2]^n; i.e., the lattice paths that do not pass through the point (1,1,...,1).A071798
Number of paths on the surface of the n-dimensional lattice [0..2]^n; i.e., the lattice paths that do not pass through the point (1,1,...,1).
- Number of lattice paths in the lattice [0..2n] X [0..2n] which do not pass through the point (n,n).A071799
Number of lattice paths in the lattice [0..2n] X [0..2n] which do not pass through the point (n,n).
- Number of lattice paths in the lattice [0..2n] X [0..2n] X [0..2n] which do not pass through the point (n,n,n). Number of paths through a lattice containing a "hole".A071800
Number of lattice paths in the lattice [0..2n] X [0..2n] X [0..2n] which do not pass through the point (n,n,n). Number of paths through a lattice containing a "hole".
- a(n) = binomial(2n, n) - binomial(n, floor(n/2))^2.A071801
a(n) = binomial(2n, n) - binomial(n, floor(n/2))^2.
- Table in which n-th row gives exponents (in decreasing order) of lexicographically earliest primitive irreducible polynomial of degree n over GF(2).A071802
Table in which n-th row gives exponents (in decreasing order) of lexicographically earliest primitive irreducible polynomial of degree n over GF(2).
- Number of paths in the lattice [0..n] X [0..n] X [0..n] which do not pass through the point (floor(n/2), floor(n/2), floor(n/2)). Number of paths through a lattice containing a "hole".A071803
Number of paths in the lattice [0..n] X [0..n] X [0..n] which do not pass through the point (floor(n/2), floor(n/2), floor(n/2)). Number of paths through a lattice containing a "hole".
- Number of pairs (x,y) such that tau(x^y) = x+y, 1<=x<=n, 1<=y<=n.A071804
Number of pairs (x,y) such that tau(x^y) = x+y, 1<=x<=n, 1<=y<=n.
- Number of pairs (x,y) such that prime(x) + prime(y) = x*tau(x) + y*tau(y), 1<=x<=y<=n.A071805
Number of pairs (x,y) such that prime(x) + prime(y) = x*tau(x) + y*tau(y), 1<=x<=y<=n.
- Number of pairs (x,y) such that prime(x) + prime(y) = y*tau(x) + x*tau(y), 1<=x<=y<=n.A071806
Number of pairs (x,y) such that prime(x) + prime(y) = y*tau(x) + x*tau(y), 1<=x<=y<=n.
- Number of pairs (x,y) such that prime(x) - prime(y) = x*tau(x) - y*tau(y), 1<=x<=y<=n.A071807
Number of pairs (x,y) such that prime(x) - prime(y) = x*tau(x) - y*tau(y), 1<=x<=y<=n.
- Smallest number s such that s*k+1 is squarefree for 1 <= k <= n.A071808
Smallest number s such that s*k+1 is squarefree for 1 <= k <= n.
- Smallest number s such that s*k-1 is squarefree for 1 <= k <= n.A071809
Smallest number s such that s*k-1 is squarefree for 1 <= k <= n.
- Number of subsets of the first n primes whose sum is a prime.A071810
Number of subsets of the first n primes whose sum is a prime.