Sequences
392,541 sequences
- Primes of the form 10*R_k + 3, where R_k is the repunit (A002275) of length k.A093011
Primes of the form 10*R_k + 3, where R_k is the repunit (A002275) of length k.
- Numbers k such that prime(k) == 3 (mod 16).A093012
Numbers k such that prime(k) == 3 (mod 16).
- Numbers n such that 10*n-3 and 10*n+3 are both primes.A093013
Numbers n such that 10*n-3 and 10*n+3 are both primes.
- Numbers n such that 10n-3 and 10n+3 are consecutive primes.A093014
Numbers n such that 10n-3 and 10n+3 are consecutive primes.
- First occurrence of n in A092926.A093015
First occurrence of n in A092926.
- First occurrence of n in A092928, or 0 if n does not occur.A093016
First occurrence of n in A092928, or 0 if n does not occur.
- Luhn algorithm double-and-add sum of digits of n.A093017
Luhn algorithm double-and-add sum of digits of n.
- Natural numbers with appended Luhn mod 10 check digit.A093018
Natural numbers with appended Luhn mod 10 check digit.
- a(n) = A093018(n) mod 10.A093019
a(n) = A093018(n) mod 10.
- Indices of terms in A093019 with value 0.A093020
Indices of terms in A093019 with value 0.
- Indices of terms in A093019 with value 1.A093021
Indices of terms in A093019 with value 1.
- Indices of terms in A093019 with value 2.A093022
Indices of terms in A093019 with value 2.
- Indices of terms in A093019 with value 3.A093023
Indices of terms in A093019 with value 3.
- Indices of terms in A093019 with value 4.A093024
Indices of terms in A093019 with value 4.
- Indices of terms in A093019 with value 5.A093025
Indices of terms in A093019 with value 5.
- Indices of terms in A093019 with value 6.A093026
Indices of terms in A093019 with value 6.
- Indices of terms in A093019 with value 7.A093027
Indices of terms in A093019 with value 7.
- Indices of terms in A093019 with value 8.A093028
Indices of terms in A093019 with value 8.
- Indices of terms in A093019 with value 9.A093029
Indices of terms in A093019 with value 9.
- Largest palindromic divisor of n.A093030
Largest palindromic divisor of n.
- Create a histogram of the digits used so far in the sequence. Add to the last element of the sequence the least used digit on the histogram. If two or more digits have the same score in the histogram, add the smallest. 0 is to be interpreted as 10 and so comes after 9. So if 0 is the digit to add, add 10 instead. Start the sequence with 0.A093031
Create a histogram of the digits used so far in the sequence. Add to the last element of the sequence the least used digit on the histogram. If two or more digits have the same score in the histogram, add the smallest. 0 is to be interpreted as 10 and so comes after 9. So if 0 is the digit to add, add 10 instead. Start the sequence with 0.
- Smallest k>0 such that at least two primes exist that are not less than n-k and not greater than n+k.A093032
Smallest k>0 such that at least two primes exist that are not less than n-k and not greater than n+k.
- Number of interior balls in a truncated octahedral arrangement.A093033
Number of interior balls in a truncated octahedral arrangement.
- Primes of the form 1 + multiple perfect number.A093034
Primes of the form 1 + multiple perfect number.
- Number of triples (d1,d2,d3) where each element is a divisor of n and d1 + d2 + d3 <= n.A093035
Number of triples (d1,d2,d3) where each element is a divisor of n and d1 + d2 + d3 <= n.
- Number of palindromic divisors of a(n) sets a new record.A093036
Number of palindromic divisors of a(n) sets a new record.
- Number of non-palindromic divisors of n sets a new record.A093037
Number of non-palindromic divisors of n sets a new record.
- Numbers k such that sum of 5th powers of divisors of k is divisible by the square of Euler-phi of k.A093038
Numbers k such that sum of 5th powers of divisors of k is divisible by the square of Euler-phi of k.
- Sequence resulting from a sum of three repeated binomial(n+3,4) sequences.A093039
Sequence resulting from a sum of three repeated binomial(n+3,4) sequences.
- Expansion of (1+x)/((1+x+x^2)(1-x-x^2)).A093040
Expansion of (1+x)/((1+x+x^2)(1-x-x^2)).
- Expansion of (1-4x+6x^2-3x^3)/(1-5x+9x^2-8x^3+4x^4).A093041
Expansion of (1-4x+6x^2-3x^3)/(1-5x+9x^2-8x^3+4x^4).
- a(n) = Jacobsthal(n) * Fibonacci(n).A093042
a(n) = Jacobsthal(n) * Fibonacci(n).
- Jacobsthal(n)*Fibonacci(n-1).A093043
Jacobsthal(n)*Fibonacci(n-1).
- A Jacobsthal Fibonacci product: a(n) = (2^n + 2*(-1)^n)*Fibonacci(n-1)/3.A093044
A Jacobsthal Fibonacci product: a(n) = (2^n + 2*(-1)^n)*Fibonacci(n-1)/3.
- 2*Jacobsthal(n-1)*Fibonacci(n).A093045
2*Jacobsthal(n-1)*Fibonacci(n).
- Primes for which A049076(p) = 13.A093046
Primes for which A049076(p) = 13.
- Primes p whose order of primeness A078442(p) is at least 12.A093047
Primes p whose order of primeness A078442(p) is at least 12.
- a(n) = n minus exponent of 2 in n, with a(0) = 0.A093048
a(n) = n minus exponent of 2 in n, with a(0) = 0.
- n-1 minus exponent of 2 in n, a(0) = 0.A093049
n-1 minus exponent of 2 in n, a(0) = 0.
- Exponent of 2 in (3^n-3)*2^(n-1).A093050
Exponent of 2 in (3^n-3)*2^(n-1).
- Exponent of 2 in (3^n-3)*2^n.A093051
Exponent of 2 in (3^n-3)*2^n.
- Exponent of 2 in 6^n - 2^n.A093052
Exponent of 2 in 6^n - 2^n.
- Continued fraction expansion of a constant x such that the n-th partial quotient equals a(n) = floor(2^n*x), with a(0)=1.A093053
Continued fraction expansion of a constant x such that the n-th partial quotient equals a(n) = floor(2^n*x), with a(0)=1.
- Decimal expansion of a constant x such that the n-th partial quotient of the continued fraction of x equals floor(2^n*x), for n>=0.A093054
Decimal expansion of a constant x such that the n-th partial quotient of the continued fraction of x equals floor(2^n*x), for n>=0.
- Triangle T(j,k) read by rows, where T(j,k) = number of non-singleton cycles in the in-situ transposition of a rectangular j X k matrix.A093055
Triangle T(j,k) read by rows, where T(j,k) = number of non-singleton cycles in the in-situ transposition of a rectangular j X k matrix.
- Triangle T(j,k) read by rows, where T(j,k) = length of the longest cycle in the in-situ transposition of a rectangular j X k matrix.A093056
Triangle T(j,k) read by rows, where T(j,k) = length of the longest cycle in the in-situ transposition of a rectangular j X k matrix.
- Triangle T(j,k) read by rows, where T(j,k) = number of matrix elements remaining at fixed position in the in-situ transposition of a rectangular j X k matrix (singleton cycles).A093057
Triangle T(j,k) read by rows, where T(j,k) = number of matrix elements remaining at fixed position in the in-situ transposition of a rectangular j X k matrix (singleton cycles).
- Numbers k such that numerator of Bernoulli(2k) is divisible by the square of 59, the second irregular prime.A093058
Numbers k such that numerator of Bernoulli(2k) is divisible by the square of 59, the second irregular prime.
- Numbers k such that the numerator of Bernoulli(2k) is divisible by the square of 67, the third irregular prime.A093059
Numbers k such that the numerator of Bernoulli(2k) is divisible by the square of 67, the third irregular prime.
- a(n) = smallest m such that numerator of Bernoulli(2m) is divisible by the first n irregular primes.A093060
a(n) = smallest m such that numerator of Bernoulli(2m) is divisible by the first n irregular primes.