Sequences
392,541 sequences
- a(1) = 1; then add 1, multiply by 2, subtract 3, multiply by 4, add 5, multiply by 6, subtract 7, multiply by 8 and so on.A085111
a(1) = 1; then add 1, multiply by 2, subtract 3, multiply by 4, add 5, multiply by 6, subtract 7, multiply by 8 and so on.
- Palindromic primes with at least 3 digits in which the absolute difference of successive digits is identical.A085112
Palindromic primes with at least 3 digits in which the absolute difference of successive digits is identical.
- Incorrect version of A083179.A085113
Incorrect version of A083179.
- Binary expansion of Sum 1/(p*2^p) where p runs through the set of Artin primes (primes with primitive root 2).A085114
Binary expansion of Sum 1/(p*2^p) where p runs through the set of Artin primes (primes with primitive root 2).
- Numerator of G(n) = Sum_{k=1..n} (1/(2*2^k)) * Sum_{j=0..k-1} 1/binomial(2^(k-j)+j,j).A085115
Numerator of G(n) = Sum_{k=1..n} (1/(2*2^k)) * Sum_{j=0..k-1} 1/binomial(2^(k-j)+j,j).
- Denominator of G(n) = Sum_{k=1..n} (1/(2*2^k)) * Sum_{j=0..k-1} 1/binomial(2^(k-j)+j,j).A085116
Denominator of G(n) = Sum_{k=1..n} (1/(2*2^k)) * Sum_{j=0..k-1} 1/binomial(2^(k-j)+j,j).
- Decimal expansion of largest Stoneham number S(3,2).A085117
Decimal expansion of largest Stoneham number S(3,2).
- Primes together with twice the odd primes.A085118
Primes together with twice the odd primes.
- a(n) = number at which the standard Ackermann function mod n stabilizes, or -1 if it does not stabilize.A085119
a(n) = number at which the standard Ackermann function mod n stabilizes, or -1 if it does not stabilize.
- a(n) = Sum_{m=1..24} (25-m)^n*A005875(m).A085120
a(n) = Sum_{m=1..24} (25-m)^n*A005875(m).
- Number of ways of writing n as the sum of three odd squares.A085121
Number of ways of writing n as the sum of three odd squares.
- a(n) = PrimePi(sigma(n)-phi(n)) - (PrimePi(sigma(n)) - PrimePi(phi(n))), where PrimePi = A000720, sigma = A000203 and phi = A000010.A085122
a(n) = PrimePi(sigma(n)-phi(n)) - (PrimePi(sigma(n)) - PrimePi(phi(n))), where PrimePi = A000720, sigma = A000203 and phi = A000010.
- Smallest member of A002473 whose digital product = A002473(n), or 0 if no such number exists.A085123
Smallest member of A002473 whose digital product = A002473(n), or 0 if no such number exists.
- Smallest multiple of n whose digital product is also a positive multiple of n, or 0 if no such number exists.A085124
Smallest multiple of n whose digital product is also a positive multiple of n, or 0 if no such number exists.
- Even numbers which are 7-smooth.A085125
Even numbers which are 7-smooth.
- Multiples of 3 which are members of A002473. Or multiples of 3 with the largest prime divisor < 10.A085126
Multiples of 3 which are members of A002473. Or multiples of 3 with the largest prime divisor < 10.
- Multiples of 4 which are members of A002473. Or multiples of 4 with the largest prime divisor < 10.A085127
Multiples of 4 which are members of A002473. Or multiples of 4 with the largest prime divisor < 10.
- Multiples of 5 which are members of A002473. Or multiples of 5 with the largest prime divisor <= 7.A085128
Multiples of 5 which are members of A002473. Or multiples of 5 with the largest prime divisor <= 7.
- Multiples of 6 which are 7-smooth.A085129
Multiples of 6 which are 7-smooth.
- Duplicate of A080194.A085130
Duplicate of A080194.
- Multiples of 8 which are 7-smooth.A085131
Multiples of 8 which are 7-smooth.
- Multiples of 9 which are 7-smooth.A085132
Multiples of 9 which are 7-smooth.
- Numbers k such that k and its digit reversal are both 7-smooth (A002473).A085133
Numbers k such that k and its digit reversal are both 7-smooth (A002473).
- Palindromes in A002473, that is, palindromes with the largest prime divisor < 10.A085134
Palindromes in A002473, that is, palindromes with the largest prime divisor < 10.
- Numbers whose cyclic permutations are all 7-smooth (A002473).A085135
Numbers whose cyclic permutations are all 7-smooth (A002473).
- Duplicate of A068868.A085136
Duplicate of A068868.
- Binary expansion of largest Stoneham number S(3,2).A085137
Binary expansion of largest Stoneham number S(3,2).
- Decimal expansion of largest "base 10" Stoneham number.A085138
Decimal expansion of largest "base 10" Stoneham number.
- a(n) = Sum_{i=0..n-1} (1 + (-1)^(n-1-i))/2 * Sum_{j=0..i} a(j)*a(i-j) for n > 0, with a(0) = 1.A085139
a(n) = Sum_{i=0..n-1} (1 + (-1)^(n-1-i))/2 * Sum_{j=0..i} a(j)*a(i-j) for n > 0, with a(0) = 1.
- Expansion of q^(-1/6) * eta(q^2)^3 / eta(q)^2 in powers of q.A085140
Expansion of q^(-1/6) * eta(q^2)^3 / eta(q)^2 in powers of q.
- Greatest nonnegative integer k such that k(3k+1)/2 <= n.A085141
Greatest nonnegative integer k such that k(3k+1)/2 <= n.
- Duplicate of A064053.A085142
Duplicate of A064053.
- Triangle table from number wall of reversion of Fibonacci numbers.A085143
Triangle table from number wall of reversion of Fibonacci numbers.
- a(0)=0, a(2n) = a(n)+1, a(2n+1) = -a(n).A085144
a(0)=0, a(2n) = a(n)+1, a(2n+1) = -a(n).
- Positions of 0 in A085144.A085145
Positions of 0 in A085144.
- Numbers k such that k!!!! + 1 is prime.A085146
Numbers k such that k!!!! + 1 is prime.
- Numbers k such that k!!!! - 1 is prime.A085147
Numbers k such that k!!!! - 1 is prime.
- Numbers k such that k!!!!! + 1 is prime.A085148
Numbers k such that k!!!!! + 1 is prime.
- Numbers k such that k!!!!! - 1 is prime.A085149
Numbers k such that k!!!!! - 1 is prime.
- Numbers k such that k!!!!!! + 1 is prime.A085150
Numbers k such that k!!!!!! + 1 is prime.
- Numbers generated by the Fibonacci polynomial x^4 + 3x^2 + 1.A085151
Numbers generated by the Fibonacci polynomial x^4 + 3x^2 + 1.
- All prime factors of n and n+1 are <= 5. (Related to the abc conjecture.)A085152
All prime factors of n and n+1 are <= 5. (Related to the abc conjecture.)
- All prime factors of n and n+1 are <= 7. (Related to the abc conjecture.)A085153
All prime factors of n and n+1 are <= 7. (Related to the abc conjecture.)
- a(n+1) = smallest number >a(n) having more prime factors than a(n), with or without repetitions; a(1)=1.A085154
a(n+1) = smallest number >a(n) having more prime factors than a(n), with or without repetitions; a(1)=1.
- Powers of semiprimes.A085155
Powers of semiprimes.
- Powers of primes or powers of semiprimes.A085156
Powers of primes or powers of semiprimes.
- Quintuple factorials, 5-factorials, n!!!!!, n!5.A085157
Quintuple factorials, 5-factorials, n!!!!!, n!5.
- Sextuple factorials, 6-factorials, n!!!!!!, n!6.A085158
Sextuple factorials, 6-factorials, n!!!!!!, n!6.
- Permutation of natural numbers induced by the Catalan bijection gma085159 acting on symbolless S-expressions encoded by A014486/A063171.A085159
Permutation of natural numbers induced by the Catalan bijection gma085159 acting on symbolless S-expressions encoded by A014486/A063171.
- Permutation of natural numbers induced by the Catalan bijection gma085160 acting on symbolless S-expressions encoded by A014486/A063171.A085160
Permutation of natural numbers induced by the Catalan bijection gma085160 acting on symbolless S-expressions encoded by A014486/A063171.