Sequences
392,541 sequences
- Largest number m such that m is the n-th power of the sum of its digits.A061211
Largest number m such that m is the n-th power of the sum of its digits.
- Erroneous version of A164883.A061212
Erroneous version of A164883.
- a(n) = 1 + product of first n positive triangular numbers (A000217).A061213
a(n) = 1 + product of first n positive triangular numbers (A000217).
- Product of composite numbers between the n-th and (n+1)st primes.A061214
Product of composite numbers between the n-th and (n+1)st primes.
- a(n)= product of all odd composite numbers between n-th prime and (n+1)-st prime.A061215
a(n)= product of all odd composite numbers between n-th prime and (n+1)-st prime.
- a(n) = product of all even numbers between n-th prime and (n+1)-st prime.A061216
a(n) = product of all even numbers between n-th prime and (n+1)-st prime.
- Number of zeros in the concatenation n(n-1)(n-2)(n-3)...321.A061217
Number of zeros in the concatenation n(n-1)(n-2)(n-3)...321.
- Least number whose number of divisors is n-th term from A014613 (numbers of form p*q*r*s, products of exactly 4 primes, counted with multiplicity).A061218
Least number whose number of divisors is n-th term from A014613 (numbers of form p*q*r*s, products of exactly 4 primes, counted with multiplicity).
- a(n) is the largest number which can be formed with no zeros, using least number of digits and having digit sum = n.A061219
a(n) is the largest number which can be formed with no zeros, using least number of digits and having digit sum = n.
- Least entry in character table of the symmetric group S_n.A061220
Least entry in character table of the symmetric group S_n.
- Number of tic-tac-toe games won after n plays.A061221
Number of tic-tac-toe games won after n plays.
- a(n) = n^2 + (n + 1)^3 + (n + 2)^4.A061222
a(n) = n^2 + (n + 1)^3 + (n + 2)^4.
- a(n) = n^3 + (n + 1)^4 + (n + 2)^5.A061223
a(n) = n^3 + (n + 1)^4 + (n + 2)^5.
- a(n) = n^2 + (n + 1)^3 + (n + 2)^4 + (n + 3)^5.A061224
a(n) = n^2 + (n + 1)^3 + (n + 2)^4 + (n + 3)^5.
- Numbers of the form k^3 + (k + 1)^4 + (k + 2)^5 + (k + 3)^6.A061225
Numbers of the form k^3 + (k + 1)^4 + (k + 2)^5 + (k + 3)^6.
- a(n) = n^2 + (n^2 with digits reversed).A061226
a(n) = n^2 + (n^2 with digits reversed).
- a(n) = p + R(p) where R(p) is the digit reversal of n-th prime p.A061227
a(n) = p + R(p) where R(p) is the digit reversal of n-th prime p.
- a(1) = 2, a(n) = smallest number greater than n that is not coprime to n.A061228
a(1) = 2, a(n) = smallest number greater than n that is not coprime to n.
- a(n) = floor of the geometric mean of n and the reversal of n.A061229
a(n) = floor of the geometric mean of n and the reversal of n.
- Numbers k such that k + the reversal of k is a square.A061230
Numbers k such that k + the reversal of k is a square.
- n - the reversal of n is a nonzero square.A061231
n - the reversal of n is a nonzero square.
- Number of primes p with n! < p <= (n+1)!.A061232
Number of primes p with n! < p <= (n+1)!.
- Pierce expansion for 4 - Pi.A061233
Pierce expansion for 4 - Pi.
- Smallest number with prime(n)^2 divisors where prime(n) is the n-th prime.A061234
Smallest number with prime(n)^2 divisors where prime(n) is the n-th prime.
- Number of primes between n^4 and (n+1)^4.A061235
Number of primes between n^4 and (n+1)^4.
- Smallest number with prime(n)^3 divisors where prime(n) is n-th prime.A061236
Smallest number with prime(n)^3 divisors where prime(n) is n-th prime.
- Prime numbers == 1 (mod 9).A061237
Prime numbers == 1 (mod 9).
- Prime numbers == 2 (mod 9).A061238
Prime numbers == 2 (mod 9).
- Prime numbers == 4 (mod 9).A061239
Prime numbers == 4 (mod 9).
- Prime numbers == 5 (mod 9).A061240
Prime numbers == 5 (mod 9).
- Prime numbers == 7 (mod 9).A061241
Prime numbers == 7 (mod 9).
- Primes of the form 9*k - 1.A061242
Primes of the form 9*k - 1.
- a(n) = n+r where r is the smallest number such that n divides (n+1)(n+2)(n+3)...(n+r).A061243
a(n) = n+r where r is the smallest number such that n divides (n+1)(n+2)(n+3)...(n+r).
- Prime numbers with odd digits in ascending order.A061244
Prime numbers with odd digits in ascending order.
- Prime numbers with odd digits in descending order.A061245
Prime numbers with odd digits in descending order.
- Prime having only {0, 1, 4, 9} as digits.A061246
Prime having only {0, 1, 4, 9} as digits.
- Primes having only {0, 1, 8} as digits.A061247
Primes having only {0, 1, 8} as digits.
- Primes at which sum of digits strictly increases.A061248
Primes at which sum of digits strictly increases.
- Smallest number with digit sum = Fibonacci(n).A061249
Smallest number with digit sum = Fibonacci(n).
- a(n) = (n-2)*(n-1)^n.A061250
a(n) = (n-2)*(n-1)^n.
- Days in year to end of n-th month starting Jan 01 in a year just following a leap year or millennium.A061251
Days in year to end of n-th month starting Jan 01 in a year just following a leap year or millennium.
- a(n) = 16^n - 15^n.A061252
a(n) = 16^n - 15^n.
- Let G_n be the elementary Abelian group G_n = (C_3)^n; a(n) is the number of times the number 1 appears in the character table of G_n.A061253
Let G_n be the elementary Abelian group G_n = (C_3)^n; a(n) is the number of times the number 1 appears in the character table of G_n.
- Odd composite numbers n such that primitive part of Fibonacci(n) (see A061446) is prime.A061254
Odd composite numbers n such that primitive part of Fibonacci(n) (see A061446) is prime.
- Euler transform of Euler totient function phi(n), cf. A000010.A061255
Euler transform of Euler totient function phi(n), cf. A000010.
- Euler transform of sigma(n), cf. A000203.A061256
Euler transform of sigma(n), cf. A000203.
- Euler transform of reduced totient function psi(n), cf. A002322.A061257
Euler transform of reduced totient function psi(n), cf. A002322.
- a(n) = Sum_{d|n} d*psi(d), where psi(d) is reduced totient function, cf. A002322.A061258
a(n) = Sum_{d|n} d*psi(d), where psi(d) is reduced totient function, cf. A002322.
- a(n)=Sum_{d|n} d*numbpart(d), where numbpart(d)=number of partitions of d, cf. A000041.A061259
a(n)=Sum_{d|n} d*numbpart(d), where numbpart(d)=number of partitions of d, cf. A000041.
- G.f.: Product_{k>=1} (1-y*x^k)^(-numbpart(k)), where numbpart(k) = number of partitions of k, cf. A000041.A061260
G.f.: Product_{k>=1} (1-y*x^k)^(-numbpart(k)), where numbpart(k) = number of partitions of k, cf. A000041.