Sequences
392,541 sequences
- a(n) = 15*n^2 + 6*n + 1.A080861
a(n) = 15*n^2 + 6*n + 1.
- Numbers which can be expressed as the sum of two distinct primes in exactly six ways.A080862
Numbers which can be expressed as the sum of two distinct primes in exactly six ways.
- Numbers n such that spf(n)-2 = spf(n+2), where spf=A020639 (smallest prime factor).A080863
Numbers n such that spf(n)-2 = spf(n+2), where spf=A020639 (smallest prime factor).
- Numbers n such that spf(n)+2 = spf(n-2), where spf=A020639 (smallest prime factor).A080864
Numbers n such that spf(n)+2 = spf(n-2), where spf=A020639 (smallest prime factor).
- Order of symmetry groups of n points on 3-dimensional sphere with minimal distance between them maximized, also known as hostile neighbor or Tammes problem.A080865
Order of symmetry groups of n points on 3-dimensional sphere with minimal distance between them maximized, also known as hostile neighbor or Tammes problem.
- Number of equal shortest edges in the solutions of the Tammes' problem.A080866
Number of equal shortest edges in the solutions of the Tammes' problem.
- Dorey's period-90 sequence (periodic from a(1)=1 onward).A080867
Dorey's period-90 sequence (periodic from a(1)=1 onward).
- First differences of A080867, modulo 10.A080868
First differences of A080867, modulo 10.
- a(n+1) = floor( (a(n) + 1)^(1 + 1/n) ), with a(1) = 1.A080869
a(n+1) = floor( (a(n) + 1)^(1 + 1/n) ), with a(1) = 1.
- a(n+1) is smallest number with a(n+1)^n > (a(n)+1)^(n+1), with a(1)=1.A080870
a(n+1) is smallest number with a(n+1)^n > (a(n)+1)^(n+1), with a(1)=1.
- a(n)*a(n+3) - a(n+1)*a(n+2) = 3, given a(0)=a(1)=1, a(2)=4.A080871
a(n)*a(n+3) - a(n+1)*a(n+2) = 3, given a(0)=a(1)=1, a(2)=4.
- a(n)*a(n+3) - a(n+1)*a(n+2) = 4, given a(0)=a(1)=1, a(2)=5.A080872
a(n)*a(n+3) - a(n+1)*a(n+2) = 4, given a(0)=a(1)=1, a(2)=5.
- a(n)*a(n+3) - a(n+1)*a(n+2) = 5, given a(0)=a(1)=1, a(2)=2.A080873
a(n)*a(n+3) - a(n+1)*a(n+2) = 5, given a(0)=a(1)=1, a(2)=2.
- a(n)*a(n+3) - a(n+1)*a(n+2) = 5, given a(0)=a(1)=1, a(2)=3.A080874
a(n)*a(n+3) - a(n+1)*a(n+2) = 5, given a(0)=a(1)=1, a(2)=3.
- a(n)*a(n+3) - a(n+1)*a(n+2) = 5, given a(0)=a(1)=1, a(2)=6.A080875
a(n)*a(n+3) - a(n+1)*a(n+2) = 5, given a(0)=a(1)=1, a(2)=6.
- a(n)*a(n+3) - a(n+1)*a(n+2) = 2^n, given a(0) = 1, a(1) = 1, and a(2) = 1.A080876
a(n)*a(n+3) - a(n+1)*a(n+2) = 2^n, given a(0) = 1, a(1) = 1, and a(2) = 1.
- a(n)*a(n+3) - a(n+1)*a(n+2) = 2^n, given a(0)=1, a(1)=1, a(2)=2.A080877
a(n)*a(n+3) - a(n+1)*a(n+2) = 2^n, given a(0)=1, a(1)=1, a(2)=2.
- a(n)*a(n+3) - a(n+1)*a(n+2) = 2^n, given a(0)=1, a(1)=1, a(2)=3.A080878
a(n)*a(n+3) - a(n+1)*a(n+2) = 2^n, given a(0)=1, a(1)=1, a(2)=3.
- a(n)*a(n+3) - a(n+1)*a(n+2) = 2^n, given a(0)=1, a(1)=1, a(2)=6.A080879
a(n)*a(n+3) - a(n+1)*a(n+2) = 2^n, given a(0)=1, a(1)=1, a(2)=6.
- a(n)*a(n+3) - a(n+1)*a(n+2) = 2^n, given a(0)=1, a(1)=2, a(2)=2.A080880
a(n)*a(n+3) - a(n+1)*a(n+2) = 2^n, given a(0)=1, a(1)=2, a(2)=2.
- a(n)*a(n+3) - a(n+1)*a(n+2) = 2^n, given a(0)=1, a(1)=2, a(2)=10.A080881
a(n)*a(n+3) - a(n+1)*a(n+2) = 2^n, given a(0)=1, a(1)=2, a(2)=10.
- a(n)*a(n+3) - a(n+1)*a(n+2) = 2^n, given a(0)=1, a(1)=3, a(2)=7.A080882
a(n)*a(n+3) - a(n+1)*a(n+2) = 2^n, given a(0)=1, a(1)=3, a(2)=7.
- Distance of n to next square.A080883
Distance of n to next square.
- Sum of (0,1) versions of Thue-Morse word (A010060) and Fibonacci word (A003849).A080884
Sum of (0,1) versions of Thue-Morse word (A010060) and Fibonacci word (A003849).
- Boolean AND of (0,1) versions of Thue-Morse word (A010060) and Fibonacci word (A003849).A080885
Boolean AND of (0,1) versions of Thue-Morse word (A010060) and Fibonacci word (A003849).
- Boolean OR of (0,1) versions of Thue-Morse word (A010060) and Fibonacci word (A003849).A080886
Boolean OR of (0,1) versions of Thue-Morse word (A010060) and Fibonacci word (A003849).
- Boolean XOR of (0,1) versions of Thue-Morse word (A010060) and Fibonacci word (A003849).A080887
Boolean XOR of (0,1) versions of Thue-Morse word (A010060) and Fibonacci word (A003849).
- Number of compositions into Fibonacci numbers (1 counted as two distinct Fibonacci numbers).A080888
Number of compositions into Fibonacci numbers (1 counted as two distinct Fibonacci numbers).
- Expansion of 1/Sum_{k>=0} (-x)^Fibonacci(k).A080889
Expansion of 1/Sum_{k>=0} (-x)^Fibonacci(k).
- Continued-fraction expansion of Komornik-Loreti constant.A080890
Continued-fraction expansion of Komornik-Loreti constant.
- Period 5: repeat [0, 1, -1, -1, 1].A080891
Period 5: repeat [0, 1, -1, -1, 1].
- Numbers k such that 3^k-2 is a semiprime.A080892
Numbers k such that 3^k-2 is a semiprime.
- Expansion of e.g.f. exp(x*C(x)) = exp((1-sqrt(1-4*x))/2), where C(x) is the g.f. of the Catalan numbers A000108.A080893
Expansion of e.g.f. exp(x*C(x)) = exp((1-sqrt(1-4*x))/2), where C(x) is the g.f. of the Catalan numbers A000108.
- Expansion of the exponential series exp( x M(x) ) = exp( (1-sqrt(1-2x-3x^2))/(2x) ), where M(x) is the ordinary generating series of the Motzkin numbers A001006.A080894
Expansion of the exponential series exp( x M(x) ) = exp( (1-sqrt(1-2x-3x^2))/(2x) ), where M(x) is the ordinary generating series of the Motzkin numbers A001006.
- Expansion of the exponential series exp( x R(x) ) = exp((1 + x - sqrt(1 - 2 x - 3x^2))/(2(1 + x))), where R(x) is the ordinary generating series of the Riordan numbers A005043.A080895
Expansion of the exponential series exp( x R(x) ) = exp((1 + x - sqrt(1 - 2 x - 3x^2))/(2(1 + x))), where R(x) is the ordinary generating series of the Riordan numbers A005043.
- Expansion of the exponential series exp( x * T(x) ) = exp( x / sqrt(1 - 2*x - 3*x^2) ), where T(x) is the ordinary generating series of the central trinomial coefficients (A002426).A080896
Expansion of the exponential series exp( x * T(x) ) = exp( x / sqrt(1 - 2*x - 3*x^2) ), where T(x) is the ordinary generating series of the central trinomial coefficients (A002426).
- Nonnegative integers written in "base American money" - the places, from the right, are pennies, nickels, dimes, quarters, 50-cent pieces, dollars, 2 dollars, 5 dollars, 10 dollars, 20 dollars, 50 dollars, 100 dollars, ...A080897
Nonnegative integers written in "base American money" - the places, from the right, are pennies, nickels, dimes, quarters, 50-cent pieces, dollars, 2 dollars, 5 dollars, 10 dollars, 20 dollars, 50 dollars, 100 dollars, ...
- a(1)=2; for n>1, a(n+1) = least prime > a(n) and congruent to a prime modulo prime successor of a(n).A080898
a(1)=2; for n>1, a(n+1) = least prime > a(n) and congruent to a prime modulo prime successor of a(n).
- Primes p(k) such that every composite number between p(k) and p(k+1) has exactly three distinct prime factors.A080899
Primes p(k) such that every composite number between p(k) and p(k+1) has exactly three distinct prime factors.
- a(1)=1; for n>1, a(n)=a(n-1)-2 if n is already in the sequence, a(n)=a(n-1)+5 otherwise.A080900
a(1)=1; for n>1, a(n)=a(n-1)-2 if n is already in the sequence, a(n)=a(n-1)+5 otherwise.
- a(1)=2; for n>1, a(n)=a(n-1)-2 if n is already in the sequence, a(n)=a(n-1)+5 otherwise.A080901
a(1)=2; for n>1, a(n)=a(n-1)-2 if n is already in the sequence, a(n)=a(n-1)+5 otherwise.
- a(1)=1, a(n)=a(n-1)+2 if (n and n+3 are in the sequence), a(n)=a(n-1)+3 otherwise.A080902
a(1)=1, a(n)=a(n-1)+2 if (n and n+3 are in the sequence), a(n)=a(n-1)+3 otherwise.
- a(1)=1; for n>1, a(n)=a(n-1)+4 if n is already in the sequence, a(n)=a(n-1)+2 otherwise.A080903
a(1)=1; for n>1, a(n)=a(n-1)+4 if n is already in the sequence, a(n)=a(n-1)+2 otherwise.
- a(1)=1; for n>1, a(n)=a(n-1)-4 if n is already in the sequence, a(n)=a(n-1)+5 otherwise.A080904
a(1)=1; for n>1, a(n)=a(n-1)-4 if n is already in the sequence, a(n)=a(n-1)+5 otherwise.
- Sequence of run lengths in first differences of A080900.A080905
Sequence of run lengths in first differences of A080900.
- Primes with an even number of digits such that the first half of the digits and the second half of the digits are both primes.A080906
Primes with an even number of digits such that the first half of the digits and the second half of the digits are both primes.
- Numbers whose aliquot sequence terminates in a 1.A080907
Numbers whose aliquot sequence terminates in a 1.
- a(n) = the sign of r(n), where r(n) is the integer in [ -2n,2n] which is congruent to (2n)! modulo 4n+1.A080908
a(n) = the sign of r(n), where r(n) is the integer in [ -2n,2n] which is congruent to (2n)! modulo 4n+1.
- a(n) = (2n+1)! modulo 4n+3, |a(n)| <= 1.A080909
a(n) = (2n+1)! modulo 4n+3, |a(n)| <= 1.
- Number of numbers that differ from n in decimal representation by exactly one edit-operation: deletion, insertion, or substitution.A080910
Number of numbers that differ from n in decimal representation by exactly one edit-operation: deletion, insertion, or substitution.