Sequences
392,541 sequences
- Twin A045954's (middle terms) that are primes.A045961
Twin A045954's (middle terms) that are primes.
- Numbers k in A045954 such that 2*k+1 is prime.A045962
Numbers k in A045954 such that 2*k+1 is prime.
- Numbers k in A045954 such that 2*k-1 is prime.A045963
Numbers k in A045954 such that 2*k-1 is prime.
- Partial sums of A045954.A045964
Partial sums of A045954.
- a(1)=2; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+1}^e_i.A045965
a(1)=2; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+1}^e_i.
- a(1)=3; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+2}^e_i.A045966
a(1)=3; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+2}^e_i.
- a(1)=4; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+1}^{e_i+1}.A045967
a(1)=4; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+1}^{e_i+1}.
- a(1)=5; for n >= 2, if n = Product p_i^e_i, then a(n) = Product p_{i+3}^e_i.A045968
a(1)=5; for n >= 2, if n = Product p_i^e_i, then a(n) = Product p_{i+3}^e_i.
- a(1)=6; if n = Product p_i^e_i, n>1, then a(n) = Product p_{i+1}^e_i * Product p_{i+2}^e_i.A045969
a(1)=6; if n = Product p_i^e_i, n>1, then a(n) = Product p_{i+1}^e_i * Product p_{i+2}^e_i.
- a(1)=7; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+4}^e_i.A045970
a(1)=7; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+4}^e_i.
- a(1)=8; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+1}^{e_i+2}.A045971
a(1)=8; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+1}^{e_i+2}.
- a(1)=9; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+2}^{e_i+1}.A045972
a(1)=9; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+2}^{e_i+1}.
- a(1)=10; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+1}^e_i * Product p_{i+3}^e_i.A045973
a(1)=10; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+1}^e_i * Product p_{i+3}^e_i.
- If m = p_i^e_i, n=Product p_j^f_j, set G_m(n) = Product p_{j+i}^{f_j*e_i}; extend G_m to all m by multiplicativity; sequence gives a(n)=G_n(n).A045974
If m = p_i^e_i, n=Product p_j^f_j, set G_m(n) = Product p_{j+i}^{f_j*e_i}; extend G_m to all m by multiplicativity; sequence gives a(n)=G_n(n).
- Take the first odd integer and multiple of 1, the next 2 even integers and multiples of 2, the next 3 odd integers and multiples of 3, the next 4 even integers and multiples of 4, ...A045975
Take the first odd integer and multiple of 1, the next 2 even integers and multiples of 2, the next 3 odd integers and multiples of 3, the next 4 even integers and multiples of 4, ...
- A product related to n-th roots of 1.A045976
A product related to n-th roots of 1.
- Smallest number with same number of divisors as n!.A045977
Smallest number with same number of divisors as n!.
- Palindromic primes that are "near miss circular primes" (all cyclic shifts except one are primes).A045978
Palindromic primes that are "near miss circular primes" (all cyclic shifts except one are primes).
- Bernoulli number B_{2n} has denominator 6.A045979
Bernoulli number B_{2n} has denominator 6.
- Numbers of the form x^3 + y^3 or x^3 - y^3.A045980
Numbers of the form x^3 + y^3 or x^3 - y^3.
- Describe all the previous terms!.A045981
Describe all the previous terms!.
- Describe all the previous terms!.A045982
Describe all the previous terms!.
- Numbers k such that n or more consecutive integers starting at k have the same number of distinct prime divisors.A045983
Numbers k such that n or more consecutive integers starting at k have the same number of distinct prime divisors.
- a(n) = smallest number m such that factorizations of n consecutive integers starting at m have same number of primes (counted with multiplicity).A045984
a(n) = smallest number m such that factorizations of n consecutive integers starting at m have same number of primes (counted with multiplicity).
- a(n) = least k such that sum of first k primes is n times a prime.A045985
a(n) = least k such that sum of first k primes is n times a prime.
- Describe the n-th triangular number A000217(n).A045986
Describe the n-th triangular number A000217(n).
- Describe 2^n.A045987
Describe 2^n.
- Describe the n-th Fibonacci number A000045(n).A045988
Describe the n-th Fibonacci number A000045(n).
- a(n) = A045954(n)/2.A045989
a(n) = A045954(n)/2.
- a(n) = A034997(n)/2.A045990
a(n) = A034997(n)/2.
- a(n) = n^3 - n^2.A045991
a(n) = n^3 - n^2.
- a(n) = binomial(2n,n) - n; number of (weakly) increasing or decreasing maps from 1,...,n to 1,...,n.A045992
a(n) = binomial(2n,n) - n; number of (weakly) increasing or decreasing maps from 1,...,n to 1,...,n.
- Expansion of (1-x)/(1 - 10*x + 18*x^2 - 8*x^3).A045993
Expansion of (1-x)/(1 - 10*x + 18*x^2 - 8*x^3).
- a(0)=1, a(n) = M(n) + Sum_{k=1..n-1} M(k)*a(n-k-1), where M(n) are the Motzkin numbers (A001006).A045994
a(0)=1, a(n) = M(n) + Sum_{k=1..n-1} M(k)*a(n-k-1), where M(n) are the Motzkin numbers (A001006).
- Rows of Fibonacci-Pascal triangle.A045995
Rows of Fibonacci-Pascal triangle.
- Number of triangles in an n X n grid (or geoplane).A045996
Number of triangles in an n X n grid (or geoplane).
- Number of iterations required to reach stationary value when applying repeatedly applying d, the number of divisors function, to n!.A045997
Number of iterations required to reach stationary value when applying repeatedly applying d, the number of divisors function, to n!.
- Binary Gleichniszahlen-Reihe (BGR) sequence: describe previous term (cf. A005150), reduce number of digits seen mod 2 (then for the purposes of this data-base, discard leading zeros).A045998
Binary Gleichniszahlen-Reihe (BGR) sequence: describe previous term (cf. A005150), reduce number of digits seen mod 2 (then for the purposes of this data-base, discard leading zeros).
- Length of n-th term of binary Gleichniszahlen-Reihe (BGR) sequence A045998.A045999
Length of n-th term of binary Gleichniszahlen-Reihe (BGR) sequence A045998.
- a(n) is the largest number m equal to the sum of digits of m^n.A046000
a(n) is the largest number m equal to the sum of digits of m^n.
- Maximal number of ordinary double points on an n-th degree algebraic surface in complex projective 3-space.A046001
Maximal number of ordinary double points on an n-th degree algebraic surface in complex projective 3-space.
- Discriminants of imaginary quadratic fields with class number 5 (negated).A046002
Discriminants of imaginary quadratic fields with class number 5 (negated).
- Discriminants of imaginary quadratic fields with class number 6 (negated).A046003
Discriminants of imaginary quadratic fields with class number 6 (negated).
- Discriminants of imaginary quadratic fields with class number 7 (negated).A046004
Discriminants of imaginary quadratic fields with class number 7 (negated).
- Discriminants of imaginary quadratic fields with class number 8 (negated).A046005
Discriminants of imaginary quadratic fields with class number 8 (negated).
- Discriminants of imaginary quadratic fields with class number 9 (negated).A046006
Discriminants of imaginary quadratic fields with class number 9 (negated).
- Discriminants of imaginary quadratic fields with class number 10 (negated).A046007
Discriminants of imaginary quadratic fields with class number 10 (negated).
- Discriminants of imaginary quadratic fields with class number 11 (negated).A046008
Discriminants of imaginary quadratic fields with class number 11 (negated).
- Discriminants of imaginary quadratic fields with class number 12 (negated).A046009
Discriminants of imaginary quadratic fields with class number 12 (negated).
- Discriminants of imaginary quadratic fields with class number 13 (negated).A046010
Discriminants of imaginary quadratic fields with class number 13 (negated).