Sequences
392,541 sequences
- a(1) = 1; a(n+1) is the smallest number not already in the sequence which differs from a(n) at every digit.A068861
a(1) = 1; a(n+1) is the smallest number not already in the sequence which differs from a(n) at every digit.
- Numbers n such that A068861(n) = n.A068862
Numbers n such that A068861(n) = n.
- a(1) = 2; a(n+1) is the smallest prime not already in the sequence which differs from a(n) at every digit.A068863
a(1) = 2; a(n+1) is the smallest prime not already in the sequence which differs from a(n) at every digit.
- a(1) = 1; a(n+1) is the smallest square not already in the sequence which differs from a(n) at every digit.A068864
a(1) = 1; a(n+1) is the smallest square not already in the sequence which differs from a(n) at every digit.
- a(1) = 1; a(n) is the smallest triangular number not already in the sequence which differs from a(n-1) at every digit.A068865
a(1) = 1; a(n) is the smallest triangular number not already in the sequence which differs from a(n-1) at every digit.
- Triangular numbers k*(k+1)/2 such that A068865(k) = k*(k+1)/2.A068866
Triangular numbers k*(k+1)/2 such that A068865(k) = k*(k+1)/2.
- Squares k^2 such that A068864(k) = k^2.A068867
Squares k^2 such that A068864(k) = k^2.
- Numbers prime(k) such that A068863(k) = prime(k).A068868
Numbers prime(k) such that A068863(k) = prime(k).
- Smallest number k such that n! + k is a square.A068869
Smallest number k such that n! + k is a square.
- Number of polyhypercubes or 4-dimensional polyominoes with n cells (regarding mirror-images as identical).A068870
Number of polyhypercubes or 4-dimensional polyominoes with n cells (regarding mirror-images as identical).
- Duplicate of A004615.A068871
Duplicate of A004615.
- Composite numbers with all divisors congruent to 1 mod 10.A068872
Composite numbers with all divisors congruent to 1 mod 10.
- Smallest prime which is a sum of n distinct primes.A068873
Smallest prime which is a sum of n distinct primes.
- Duplicate of A018936.A068874
Duplicate of A018936.
- Expansion of (1 + x*C)*C, where C = (1 - (1 - 4*x)^(1/2))/(2*x) is the g.f. for Catalan numbers, A000108.A068875
Expansion of (1 + x*C)*C, where C = (1 - (1 - 4*x)^(1/2))/(2*x) is the g.f. for Catalan numbers, A000108.
- Smallest n-digit prime with property that digits alternate in parity.A068876
Smallest n-digit prime with property that digits alternate in parity.
- Largest n-digit prime with property that digits alternate in parity.A068877
Largest n-digit prime with property that digits alternate in parity.
- Denominators of nonzero terms in the expansion of sin(x)+exp(x)-1-2*x.A068878
Denominators of nonzero terms in the expansion of sin(x)+exp(x)-1-2*x.
- Duplicate of A030152.A068879
Duplicate of A030152.
- Smallest n-digit square with property that digits alternate in parity.A068880
Smallest n-digit square with property that digits alternate in parity.
- Largest n-digit square with property that digits alternate in parity, or 0 if no such number exists.A068881
Largest n-digit square with property that digits alternate in parity, or 0 if no such number exists.
- Triangular numbers with property that digits alternate in parity.A068882
Triangular numbers with property that digits alternate in parity.
- Smallest n-digit triangular numbers with property that digits alternate in parity, or 0 if no such number exists.A068883
Smallest n-digit triangular numbers with property that digits alternate in parity, or 0 if no such number exists.
- Largest n-digit triangular number with property that digits alternate in parity, or 0 if no such number exists.A068884
Largest n-digit triangular number with property that digits alternate in parity, or 0 if no such number exists.
- Numerator of Sum_{k=1..n} k/phi(k).A068885
Numerator of Sum_{k=1..n} k/phi(k).
- First of n consecutive numbers such that the k-th number is divisible by a k-th power for k = 1,...,n.A068886
First of n consecutive numbers such that the k-th number is divisible by a k-th power for k = 1,...,n.
- Primes with property that digits alternate in parity individually as well as in concatenation with previous terms.A068887
Primes with property that digits alternate in parity individually as well as in concatenation with previous terms.
- Squares with property that digits alternate in parity individually as well as in concatenation with previous terms.A068888
Squares with property that digits alternate in parity individually as well as in concatenation with previous terms.
- Triangular numbers with property that digits alternate in parity individually as well as in concatenation with previous terms.A068889
Triangular numbers with property that digits alternate in parity individually as well as in concatenation with previous terms.
- a(1) = 1; a(n) = smallest nontrivial n-th power with property that digits alternate in parity.A068890
a(1) = 1; a(n) = smallest nontrivial n-th power with property that digits alternate in parity.
- a(1) = 1; a(n) = smallest nontrivial n-th power with property that digits alternate in parity individually as well as in concatenation with previous terms.A068891
a(1) = 1; a(n) = smallest nontrivial n-th power with property that digits alternate in parity individually as well as in concatenation with previous terms.
- Incorrect version of A085869.A068892
Incorrect version of A085869.
- Nonpalindromic numbers that have the same prime signature as their digit reversal.A068893
Nonpalindromic numbers that have the same prime signature as their digit reversal.
- a(1) = 1; a(n) is the smallest n-th power which is congruent to 1 mod a(n-1).A068894
a(1) = 1; a(n) is the smallest n-th power which is congruent to 1 mod a(n-1).
- a(1) = 1; a(n) is the smallest cube which is congruent to 1 mod a(n-1).A068895
a(1) = 1; a(n) is the smallest cube which is congruent to 1 mod a(n-1).
- Primes containing 2k digits in which the sum of the first k digits is that of the last k digits.A068896
Primes containing 2k digits in which the sum of the first k digits is that of the last k digits.
- Squares containing 2k digits in which the sum of the first k digits = that of the rest.A068897
Squares containing 2k digits in which the sum of the first k digits = that of the rest.
- Triangular numbers containing 2k digits in which the sum of the first k digits = that of the rest.A068898
Triangular numbers containing 2k digits in which the sum of the first k digits = that of the rest.
- Triangular numbers containing 2n digits obtained by duplicating the first n digits; i.e., triangular numbers in A020338.A068899
Triangular numbers containing 2n digits obtained by duplicating the first n digits; i.e., triangular numbers in A020338.
- Digit reversal of n = 11 times digit reversal of n/11.A068900
Digit reversal of n = 11 times digit reversal of n/11.
- Least number that when added to the n-th prime gives a multiple of n.A068901
Least number that when added to the n-th prime gives a multiple of n.
- Least multiple of n not less than the n-th prime.A068902
Least multiple of n not less than the n-th prime.
- Binomial(tau(n),omega(n)), where tau(n) is the number of divisors of n (A000005) and omega the number of distinct prime factors (A001221).A068903
Binomial(tau(n),omega(n)), where tau(n) is the number of divisors of n (A000005) and omega the number of distinct prime factors (A001221).
- a(n) = binomial(sigma(n),tau(n)), where sigma(n) is the sum and tau(n) the number of divisors of n (A000203, A000005).A068904
a(n) = binomial(sigma(n),tau(n)), where sigma(n) is the sum and tau(n) the number of divisors of n (A000203, A000005).
- Binomial(sigma(n),omega(n)), where sigma(n) is the sum of divisors of n (A000203) and omega the number of distinct prime factors (A001221).A068905
Binomial(sigma(n),omega(n)), where sigma(n) is the sum of divisors of n (A000203) and omega the number of distinct prime factors (A001221).
- Square array read by ascending antidiagonals of partitions of k modulo n.A068906
Square array read by ascending antidiagonals of partitions of k modulo n.
- Number of partitions of n modulo 3.A068907
Number of partitions of n modulo 3.
- Number of partitions of n modulo 5.A068908
Number of partitions of n modulo 5.
- Number of partitions of n modulo 7.A068909
Number of partitions of n modulo 7.
- a(n) is the unique k such that palindrome A068065(n) = k + reverse(k).A068910
a(n) is the unique k such that palindrome A068065(n) = k + reverse(k).