Sequences
392,541 sequences
- Number of distinct 8th powers modulo n.A085311
Number of distinct 8th powers modulo n.
- Number of distinct 9th powers modulo n.A085312
Number of distinct 9th powers modulo n.
- Number of distinct 10th power residues modulo n.A085313
Number of distinct 10th power residues modulo n.
- Number of distinct 11th powers modulo n.A085314
Number of distinct 11th powers modulo n.
- Numbers such that first reversing digits and after forming its cube equals the result of first-form-cube and after-reverse operation with exclusion of cases divisible by 10.A085315
Numbers such that first reversing digits and after forming its cube equals the result of first-form-cube and after-reverse operation with exclusion of cases divisible by 10.
- Duplicate of A006686.A085316
Duplicate of A006686.
- Primes which are the sum of three nonzero squares.A085317
Primes which are the sum of three nonzero squares.
- Primes which are the sum of three positive 4th powers.A085318
Primes which are the sum of three positive 4th powers.
- Primes which are the sum of three 5th powers.A085319
Primes which are the sum of three 5th powers.
- First difference sequence of A003349, i.e., consecutive differences between those consecutive numbers which are sums of four 5th powers.A085320
First difference sequence of A003349, i.e., consecutive differences between those consecutive numbers which are sums of four 5th powers.
- First difference sequence of A003337, i.e., consecutive differences between those consecutive numbers which are sums of three 4th powers.A085321
First difference sequence of A003337, i.e., consecutive differences between those consecutive numbers which are sums of three 4th powers.
- Terms m of A003337 such that m+1 is also in A003337. I.e., smaller one of two consecutive numbers, both equal to a sum of three 4th powers.A085322
Terms m of A003337 such that m+1 is also in A003337. I.e., smaller one of two consecutive numbers, both equal to a sum of three 4th powers.
- Numbers k such that both k and k+1 are sums of two positive cubes.A085323
Numbers k such that both k and k+1 are sums of two positive cubes.
- a(n) is the least exponent so that reverse(n^a(n)) is a prime number. a(n)=0 if no such exponent exists, namely when e.g., n = 3k or n = 11k, k > 1.A085324
a(n) is the least exponent so that reverse(n^a(n)) is a prime number. a(n)=0 if no such exponent exists, namely when e.g., n = 3k or n = 11k, k > 1.
- a(n) is the least number m such that the minimal exponent for which reverse(m^n) = prime holds is n. Thus reverse(m^k) is composite for k = 1, .., n-1.A085325
a(n) is the least number m such that the minimal exponent for which reverse(m^n) = prime holds is n. Thus reverse(m^k) is composite for k = 1, .., n-1.
- a(n)=p is smallest prime such that rev(p)=n^j with some exponent, or 0 if no such prime exists [when e.g. n=1,n=3k or n=11k, k>1].A085326
a(n)=p is smallest prime such that rev(p)=n^j with some exponent, or 0 if no such prime exists [when e.g. n=1,n=3k or n=11k, k>1].
- Duplicate of A069403.A085327
Duplicate of A069403.
- Record values in A085068.A085328
Record values in A085068.
- Non-palindromic solutions to sigma(R(n)) = sigma(n), where R = A004086 is digit-reversal.A085329
Non-palindromic solutions to sigma(R(n)) = sigma(n), where R = A004086 is digit-reversal.
- Where records occur in A085068.A085330
Where records occur in A085068.
- Numbers k such that phi(rev(k)) = k.A085331
Numbers k such that phi(rev(k)) = k.
- Prime powers that are sums of two positive cubes.A085332
Prime powers that are sums of two positive cubes.
- a(n) is the least n-th power of a prime that is the sum of two positive cubes, or 0 if no solution exists (for n=3k).A085333
a(n) is the least n-th power of a prime that is the sum of two positive cubes, or 0 if no solution exists (for n=3k).
- Numbers which are neither sums of 2,3,4,5 or that of 6 nonnegative cubes.A085334
Numbers which are neither sums of 2,3,4,5 or that of 6 nonnegative cubes.
- Duplicate of A069137.A085335
Duplicate of A069137.
- Numbers which are sums of two and also sums of three positive cubes.A085336
Numbers which are sums of two and also sums of three positive cubes.
- Numbers which are sums of two, three and four cubes.A085337
Numbers which are sums of two, three and four cubes.
- Numbers which are sums of two, three, four and also sums of five cubes.A085338
Numbers which are sums of two, three, four and also sums of five cubes.
- Modulo 91 remainders of 6th powers.A085339
Modulo 91 remainders of 6th powers.
- a(n) is the value of determinant of the following special matrix: diagonal values equal to n-2; upper triangular entries equal to -1; lower triangular values are +1.A085340
a(n) is the value of determinant of the following special matrix: diagonal values equal to n-2; upper triangular entries equal to -1; lower triangular values are +1.
- Number of primes between sigma(n) and n inclusive.A085341
Number of primes between sigma(n) and n inclusive.
- Number of primes between phi(n) and n, where n is included in the count if it is a prime, while phi(n) is never included in the count even if it is a prime.A085342
Number of primes between phi(n) and n, where n is included in the count if it is a prime, while phi(n) is never included in the count even if it is a prime.
- Number of primes between sigma(n) and phi(n) inclusive.A085343
Number of primes between sigma(n) and phi(n) inclusive.
- Least number x such that number of primes between sigma(x) and x equals n.A085344
Least number x such that number of primes between sigma(x) and x equals n.
- Least number x such that number of primes between phi(x) and x equals n.A085345
Least number x such that number of primes between phi(x) and x equals n.
- Least number x so that number of primes between sigma(x) and phi(x) equals n.A085346
Least number x so that number of primes between sigma(x) and phi(x) equals n.
- Least number x so that number of primes not exceeding sigma(x) equals n.A085347
Least number x so that number of primes not exceeding sigma(x) equals n.
- Ratio-determined insertion sequence I(0.264) (see the link below).A085348
Ratio-determined insertion sequence I(0.264) (see the link below).
- Ratio-determined insertion sequence I(0.26688) (see the link below).A085349
Ratio-determined insertion sequence I(0.26688) (see the link below).
- Binomial transform of poly-Bernoulli numbers A027649.A085350
Binomial transform of poly-Bernoulli numbers A027649.
- Expansion of (1-3*x)/((1-4*x)*(1-5*x)).A085351
Expansion of (1-3*x)/((1-4*x)*(1-5*x)).
- Expansion of (1-4x)/((1-5x)(1-6x)).A085352
Expansion of (1-4x)/((1-5x)(1-6x)).
- Expansion of (1-5*x)/((1-6*x)*(1-7*x)).A085353
Expansion of (1-5*x)/((1-6*x)*(1-7*x)).
- a(n) = 3*4^n - (n+4)*2^(n-1).A085354
a(n) = 3*4^n - (n+4)*2^(n-1).
- a(n) is the difference between A084321(n) and the (n-1)th power of 2.A085355
a(n) is the difference between A084321(n) and the (n-1)th power of 2.
- a(n) = polygorial(n,3)/polygorial(3,n), n >= 3.A085356
a(n) = polygorial(n,3)/polygorial(3,n), n >= 3.
- Common residues of binomial(3n,n)/(2n+1) modulo 2: relates ternary trees (A001764) to the infinite Fibonacci word (A003849).A085357
Common residues of binomial(3n,n)/(2n+1) modulo 2: relates ternary trees (A001764) to the infinite Fibonacci word (A003849).
- Runs of zeros in binomial(3k,k)/(2k+1) (Mod 2): relates ternary trees (A001764) to the infinite Fibonacci word (A003849).A085358
Runs of zeros in binomial(3k,k)/(2k+1) (Mod 2): relates ternary trees (A001764) to the infinite Fibonacci word (A003849).
- Third self-convolution of A085357 (residues of binomial(3k,k)/(2k+1) modulo 2).A085359
Third self-convolution of A085357 (residues of binomial(3k,k)/(2k+1) modulo 2).
- Partial sums of A026905; the convolution of the natural numbers with the partition function.A085360
Partial sums of A026905; the convolution of the natural numbers with the partition function.