Sequences
392,541 sequences
- a(2n) and a(2n+1) are side lengths of a Beentjes sequence of perfect squared rectangles, starting with a 33 X 32 rectangle.A067011
a(2n) and a(2n+1) are side lengths of a Beentjes sequence of perfect squared rectangles, starting with a 33 X 32 rectangle.
- Absolute composites: every permutation of digits (dropping any leading zeros) is a composite number.A067012
Absolute composites: every permutation of digits (dropping any leading zeros) is a composite number.
- Numbers with property that every permutation of digits (dropping any leading zeros) is 1 or a composite number.A067013
Numbers with property that every permutation of digits (dropping any leading zeros) is 1 or a composite number.
- a(1)=1 and a(n+1)=phi(a(n))+a(phi(n)) for n>0.A067014
a(1)=1 and a(n+1)=phi(a(n))+a(phi(n)) for n>0.
- Triangle T(n,k) (n>=1, rows have irregular lengths) giving number of arrangements of k nonattacking princes on an n X n staggered hexagonal torus board.A067015
Triangle T(n,k) (n>=1, rows have irregular lengths) giving number of arrangements of k nonattacking princes on an n X n staggered hexagonal torus board.
- Start with a(0)=1, a(1)=4, a(2)=3, a(3)=2; for n>=3, a(n+1) = max_i (a(i)+a(n-i)).A067016
Start with a(0)=1, a(1)=4, a(2)=3, a(3)=2; for n>=3, a(n+1) = max_i (a(i)+a(n-i)).
- Start with a(0)=1, a(1)=4, a(2)=3, a(3)=2; for n>=3, a(n+1) = mex_i (a(i)+a(n-i)), where mex means smallest nonnegative missing number.A067017
Start with a(0)=1, a(1)=4, a(2)=3, a(3)=2; for n>=3, a(n+1) = mex_i (a(i)+a(n-i)), where mex means smallest nonnegative missing number.
- Start with a(0)=1, a(1)=4, a(2)=3, a(3)=2; for n>=3, a(n+1) = mex_i (nim-sum a(i)+a(n-i)), where mex means smallest nonnegative missing number.A067018
Start with a(0)=1, a(1)=4, a(2)=3, a(3)=2; for n>=3, a(n+1) = mex_i (nim-sum a(i)+a(n-i)), where mex means smallest nonnegative missing number.
- Odd numbers with an odd number of prime factors (counted with multiplicity).A067019
Odd numbers with an odd number of prime factors (counted with multiplicity).
- Duplicate of A051913.A067020
Duplicate of A051913.
- Largest prime of which the square still does not exceed the product of first n primes, the n-th primorial.A067021
Largest prime of which the square still does not exceed the product of first n primes, the n-th primorial.
- Exponent of largest power of (n+1)-st prime which is still smaller than the product of first n primes, the n-th primorial.A067022
Exponent of largest power of (n+1)-st prime which is still smaller than the product of first n primes, the n-th primorial.
- Sigma-crowded numbers: n such that d(n)/sigma(n) is larger than d(m)/sigma(m) for all m > n.A067023
Sigma-crowded numbers: n such that d(n)/sigma(n) is larger than d(m)/sigma(m) for all m > n.
- Smallest prime p such that p+2 has exactly n distinct prime factors.A067024
Smallest prime p such that p+2 has exactly n distinct prime factors.
- Exponents of prime-powers corresponding to terms of A053705(n)+2.A067025
Exponents of prime-powers corresponding to terms of A053705(n)+2.
- (Prime(n)# - 4)/2 is prime, where x# is the primorial A034386(x).A067026
(Prime(n)# - 4)/2 is prime, where x# is the primorial A034386(x).
- Numbers n such that (prime(n)# + 4)/2 is a prime, where x# is the primorial A034386(x).A067027
Numbers n such that (prime(n)# + 4)/2 is a prime, where x# is the primorial A034386(x).
- Numbers with a composite number of prime factors (counted with multiplicity).A067028
Numbers with a composite number of prime factors (counted with multiplicity).
- Exponent of least prime factor in prime factorization of n, a(1)=0.A067029
Exponent of least prime factor in prime factorization of n, a(1)=0.
- Numbers of the form k + reverse(k) for at least one k.A067030
Numbers of the form k + reverse(k) for at least one k.
- Numbers that are not of the form k + reverse(k) for any k.A067031
Numbers that are not of the form k + reverse(k) for any k.
- Number of k's such that A067030(n) = k + reverse(k).A067032
Number of k's such that A067030(n) = k + reverse(k).
- Smallest k such that A067030(n) = k + reverse(k).A067033
Smallest k such that A067030(n) = k + reverse(k).
- Largest k such that A067030(n) = k + reverse(k).A067034
Largest k such that A067030(n) = k + reverse(k).
- n sets a new record for the number of integers k such that n = k + reverse(k).A067035
n sets a new record for the number of integers k such that n = k + reverse(k).
- Records for the number of integers k such that an integer is of the form k + reverse(k).A067036
Records for the number of integers k such that an integer is of the form k + reverse(k).
- a(n) = n^m where m = floor(Sum_{k=1..n} 1/k).A067037
a(n) = n^m where m = floor(Sum_{k=1..n} 1/k).
- a(n) = floor(n^m) where m = Sum_{k=1..n} (1/k).A067038
a(n) = floor(n^m) where m = Sum_{k=1..n} (1/k).
- The tower function n^{(n-1)!}.A067039
The tower function n^{(n-1)!}.
- a(n) = n^(sum of digits of n).A067040
a(n) = n^(sum of digits of n).
- a(n) = n^(product of digits of n).A067041
a(n) = n^(product of digits of n).
- Numbers in which the product of digits in even positions = product of digits in odd positions.A067042
Numbers in which the product of digits in even positions = product of digits in odd positions.
- Nondecreasing sums of digits: a(0) = 0 and for n>0: a(n) = Min{m>n|SumOfDigits(m)>= SumOfDigits(a(n-1))}, where SumOfDigits = A007953.A067043
Nondecreasing sums of digits: a(0) = 0 and for n>0: a(n) = Min{m>n|SumOfDigits(m)>= SumOfDigits(a(n-1))}, where SumOfDigits = A007953.
- Smallest positive k such that k*n contains only even digits.A067044
Smallest positive k such that k*n contains only even digits.
- Duplicate of A061807.A067045
Duplicate of A061807.
- a(n) = lcm(n, n+1, n+2)/6.A067046
a(n) = lcm(n, n+1, n+2)/6.
- a(n) = lcm(n, n+1, n+2, n+3)/12.A067047
a(n) = lcm(n, n+1, n+2, n+3)/12.
- a(n) = lcm(n, n+1, n+2, n+3, n+4) / 60.A067048
a(n) = lcm(n, n+1, n+2, n+3, n+4) / 60.
- Triangle T(n,r) = lcm(n,n-1,n-2,...,n-r+1)/lcm(1,2,3,...,r-1,r), 0 <= r < n.A067049
Triangle T(n,r) = lcm(n,n-1,n-2,...,n-r+1)/lcm(1,2,3,...,r-1,r), 0 <= r < n.
- Triangle T(n,r), n>=0, r=n, n-1, ..., 1, 0; where T(n,r) = product of all possible sums of r numbers chosen from [1..n].A067050
Triangle T(n,r), n>=0, r=n, n-1, ..., 1, 0; where T(n,r) = product of all possible sums of r numbers chosen from [1..n].
- The smallest k>1 such that k divides sigma(k*n) is equal to 3.A067051
The smallest k>1 such that k divides sigma(k*n) is equal to 3.
- a(n) = floor((Sum_{i=1..n} 1/i)^n).A067052
a(n) = floor((Sum_{i=1..n} 1/i)^n).
- Floor[ Sum_{1..n} 1/i ]^n.A067053
Floor[ Sum_{1..n} 1/i ]^n.
- a(n) = floor(s^s) where s = Sum_{k=1..n} 1/k.A067054
a(n) = floor(s^s) where s = Sum_{k=1..n} 1/k.
- a(n) = (n!)^(n*(n+1)/2).A067055
a(n) = (n!)^(n*(n+1)/2).
- a(n) = (1)*(2 + 3 + 4 + ... + n) + (1 + 2)*(3 + 4 + 5 + ... + n) + (1 + 2 + 3)*(4 + 5 + 6 + ... + n) + ... + (1 + 2 + 3 + ... + n-1)*n.A067056
a(n) = (1)*(2 + 3 + 4 + ... + n) + (1 + 2)*(3 + 4 + 5 + ... + n) + (1 + 2 + 3)*(4 + 5 + 6 + ... + n) + ... + (1 + 2 + 3 + ... + n-1)*n.
- Let A(n) = {1,2,3,...n}. Let B(r) and C(n-r) be two subsets of A(n) having r and n-r elements respectively, such that B(r) U C(n-r) = A(n) and B and C are disjoint; then a(n) = sum of the products of all combination sums of elements of B and C for r =1 to n-1.A067057
Let A(n) = {1,2,3,...n}. Let B(r) and C(n-r) be two subsets of A(n) having r and n-r elements respectively, such that B(r) U C(n-r) = A(n) and B and C are disjoint; then a(n) = sum of the products of all combination sums of elements of B and C for r =1 to n-1.
- Numbers n such that sigma(n+2) - sigma(n) = prime(n+2) - prime(n).A067058
Numbers n such that sigma(n+2) - sigma(n) = prime(n+2) - prime(n).
- Square array read by antidiagonals of partitions which half fill an n*k box, i.e., partitions of floor(nk/2) or ceiling(nk/2) into up to n positive integers, each no more than k.A067059
Square array read by antidiagonals of partitions which half fill an n*k box, i.e., partitions of floor(nk/2) or ceiling(nk/2) into up to n positive integers, each no more than k.
- A permutation of the positive integers in groups of four such that any two consecutive numbers differ by at least 2.A067060
A permutation of the positive integers in groups of four such that any two consecutive numbers differ by at least 2.