Sequences
392,541 sequences
- a(0) = 2; for n>0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a multiple of 3".A080711
a(0) = 2; for n>0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a multiple of 3".
- a(0) = 4; for n>0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a multiple of 3".A080712
a(0) = 4; for n>0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a multiple of 3".
- Numbers not of the form p + q^2.A080713
Numbers not of the form p + q^2.
- a(n) is taken to be the (n-th)-smallest positive integer greater than a(n-1) that is consistent with the condition "n is a member of the sequence if and only if a(n) is odd.".A080714
a(n) is taken to be the (n-th)-smallest positive integer greater than a(n-1) that is consistent with the condition "n is a member of the sequence if and only if a(n) is odd.".
- Numbers k such that for any positive integers (a, b), if a * b = k then a + b is prime.A080715
Numbers k such that for any positive integers (a, b), if a * b = k then a + b is prime.
- Numbers n such that sum of the divisors of n equals the sum of the reversals of the divisors of n.A080716
Numbers n such that sum of the divisors of n equals the sum of the reversals of the divisors of n.
- Let S(0) = 1; obtain S(k) from S(k-1) by applying 1 -> 2, 2 -> 31, 3 -> 332; sequence is S(0), S(1), S(2), ...A080717
Let S(0) = 1; obtain S(k) from S(k-1) by applying 1 -> 2, 2 -> 31, 3 -> 332; sequence is S(0), S(1), S(2), ...
- 1, together with numbers n that are the product of two primes p and q such that the multiset of the digits of n coincides with the multiset of the digits of p and q.A080718
1, together with numbers n that are the product of two primes p and q such that the multiset of the digits of n coincides with the multiset of the digits of p and q.
- Replace decimal digits with their binary values and convert back to decimal representation.A080719
Replace decimal digits with their binary values and convert back to decimal representation.
- a(0) = 5; for n>0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a multiple of 3".A080720
a(0) = 5; for n>0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a multiple of 3".
- Triangle of binomial(n,k)*(binomial(n+k,k)-binomial(n+k-2,k-1)).A080721
Triangle of binomial(n,k)*(binomial(n+k,k)-binomial(n+k-2,k-1)).
- a(0) = 0; for n > 0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a term of the sequence if and only if a(n) == 1 (mod 3)".A080722
a(0) = 0; for n > 0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a term of the sequence if and only if a(n) == 1 (mod 3)".
- a(0) = 1; for n>0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) == 1 mod 3".A080723
a(0) = 1; for n>0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) == 1 mod 3".
- a(0) = 2; for n>0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) == 1 mod 3".A080724
a(0) = 2; for n>0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) == 1 mod 3".
- a(1) = 2; for n>1, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) == 1 mod 3".A080725
a(1) = 2; for n>1, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) == 1 mod 3".
- a(0) = 0; for n>0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) == 2 mod 3".A080726
a(0) = 0; for n>0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) == 2 mod 3".
- a(0) = 1; for n>0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) == 2 mod 3".A080727
a(0) = 1; for n>0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) == 2 mod 3".
- a(0) = 3; for n>0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) == 2 mod 3".A080728
a(0) = 3; for n>0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) == 2 mod 3".
- Decimal expansion of the infinite product of zeta functions for even arguments.A080729
Decimal expansion of the infinite product of zeta functions for even arguments.
- Decimal expansion of the infinite product of zeta functions for odd arguments >= 3.A080730
Decimal expansion of the infinite product of zeta functions for odd arguments >= 3.
- a(1)=1; a(2)=6; for n > 2, a(n) is taken as the smallest positive integer greater than a(n-1) such that the condition "n is a member of the sequence if and only if a(n) is odd" is satisfied.A080731
a(1)=1; a(2)=6; for n > 2, a(n) is taken as the smallest positive integer greater than a(n-1) such that the condition "n is a member of the sequence if and only if a(n) is odd" is satisfied.
- Smallest distance from n to a prime power (as defined in A246655).A080732
Smallest distance from n to a prime power (as defined in A246655).
- Smallest distance from n to a squarefree number.A080733
Smallest distance from n to a squarefree number.
- a(1)=1, then a(n)=a(n-1)+2 if the final decimal digit of a(n) is 0, a(n)=a(n-1)+3 otherwise.A080734
a(1)=1, then a(n)=a(n-1)+2 if the final decimal digit of a(n) is 0, a(n)=a(n-1)+3 otherwise.
- a(1)=1, then a(n)=2*a(n-1) if a(n-1) is prime, a(n)=a(n-1)+1 otherwise.A080735
a(1)=1, then a(n)=2*a(n-1) if a(n-1) is prime, a(n)=a(n-1)+1 otherwise.
- Multiplicative function defined by a(1)=1, a(2)=0, a(2^r) = phi(2^r) (r>1), a(p^r) = phi(p^r) (p odd prime, r>=1), where phi is Euler's function A000010.A080736
Multiplicative function defined by a(1)=1, a(2)=0, a(2^r) = phi(2^r) (r>1), a(p^r) = phi(p^r) (p odd prime, r>=1), where phi is Euler's function A000010.
- a(1) = a(2) = 0; for n > 2, the least dimension of a lattice possessing a symmetry of order n.A080737
a(1) = a(2) = 0; for n > 2, the least dimension of a lattice possessing a symmetry of order n.
- Array read by rows in which 0th row is {1,2}; for n>0, n-th row gives finite orders of 2n X 2n integer matrices that are not orders of 2n-1 X 2n-1 integer matrices.A080738
Array read by rows in which 0th row is {1,2}; for n>0, n-th row gives finite orders of 2n X 2n integer matrices that are not orders of 2n-1 X 2n-1 integer matrices.
- Number of elements in n-th row of A080738.A080739
Number of elements in n-th row of A080738.
- a(n) = number of m such that A080737(m) <= 2n.A080740
a(n) = number of m such that A080737(m) <= 2n.
- Smallest element of n-th row of A080738.A080741
Smallest element of n-th row of A080738.
- Largest element of n-th row of A080738.A080742
Largest element of n-th row of A080738.
- Array read by rows in which n-th row lists orders of elements of Symm(n) that are not orders of elements of Symm(n-1) (6th row is empty, written as 0 by convention).A080743
Array read by rows in which n-th row lists orders of elements of Symm(n) that are not orders of elements of Symm(n-1) (6th row is empty, written as 0 by convention).
- Smallest element of n-th row of A080743.A080744
Smallest element of n-th row of A080743.
- Inverse Aronson transform of Fibonacci numbers 1,2,3,5,8,13,...A080745
Inverse Aronson transform of Fibonacci numbers 1,2,3,5,8,13,...
- Inverse Aronson transform of lower Wythoff sequence A000201.A080746
Inverse Aronson transform of lower Wythoff sequence A000201.
- Sarrus numbers with more than 2 distinct prime factors.A080747
Sarrus numbers with more than 2 distinct prime factors.
- Number of distinct prime factors of n-th Fermat pseudoprime to base 2.A080748
Number of distinct prime factors of n-th Fermat pseudoprime to base 2.
- Duplicate of A070973.A080749
Duplicate of A070973.
- a(n) = largest number greater than a(n-1) such that the first n terms of the sequence contain a total of a(n) base-10 digits.A080750
a(n) = largest number greater than a(n-1) such that the first n terms of the sequence contain a total of a(n) base-10 digits.
- a(n) is smallest number such that the sequence contains a total of a(n) base 10 digits + commas through n terms (assuming one comma between each pair of terms).A080751
a(n) is smallest number such that the sequence contains a total of a(n) base 10 digits + commas through n terms (assuming one comma between each pair of terms).
- a(1)=1; a(2)=8; for n > 2, a(n) is smallest integer greater than a(n-1) that satisfies the condition "n is in the sequence if and only if a(n) is odd.".A080752
a(1)=1; a(2)=8; for n > 2, a(n) is smallest integer greater than a(n-1) that satisfies the condition "n is in the sequence if and only if a(n) is odd.".
- a(1)=2; for n > 1, a is the second-smallest positive integer greater than a(n-1) such that the condition "n is in the sequence if and only if a(n) is odd" is satisfied.A080753
a(1)=2; for n > 1, a is the second-smallest positive integer greater than a(n-1) such that the condition "n is in the sequence if and only if a(n) is odd" is satisfied.
- a(n) = ceiling(n*(1+sqrt(2))).A080754
a(n) = ceiling(n*(1+sqrt(2))).
- a(n) = ceiling(n*(1+1/sqrt(2))).A080755
a(n) = ceiling(n*(1+1/sqrt(2))).
- Numbers k such that there are infinitely many multiples of k that have exactly k divisors.A080756
Numbers k such that there are infinitely many multiples of k that have exactly k divisors.
- First differences of Beatty sequence A022838(n) = floor(n sqrt(3)).A080757
First differences of Beatty sequence A022838(n) = floor(n sqrt(3)).
- Number of steps needed to reach a prime starting with n and iterating x-->floor(3x/2).A080758
Number of steps needed to reach a prime starting with n and iterating x-->floor(3x/2).
- Inverse Aronson transform of primes.A080759
Inverse Aronson transform of primes.
- Aronson transform of lower Wythoff sequence A000201.A080760
Aronson transform of lower Wythoff sequence A000201.