Sequences
392,541 sequences
- Square decrescendo subsequences: triangle T(n,k) = (n-k)^2, n >= 1, 0 <= k < n.A055461
Square decrescendo subsequences: triangle T(n,k) = (n-k)^2, n >= 1, 0 <= k < n.
- Superduperfactorials: product of first n superfactorials.A055462
Superduperfactorials: product of first n superfactorials.
- a(n) = 2*a(n-1)*a(n-2) - 3*a(n-3), with a(0) = 0, a(1) = 1, a(2) = 2.A055463
a(n) = 2*a(n-1)*a(n-2) - 3*a(n-3), with a(0) = 0, a(1) = 1, a(2) = 2.
- Numbers n such that sum of EulerPhi and DivisorSum is an integer multiple of the number of divisors.A055464
Numbers n such that sum of EulerPhi and DivisorSum is an integer multiple of the number of divisors.
- Composite numbers k for which phi(k) + sigma(k) is an integer multiple of the number of divisors of k.A055465
Composite numbers k for which phi(k) + sigma(k) is an integer multiple of the number of divisors of k.
- Numbers k such that d(k)^2 divides phi(k) + sigma(k).A055466
Numbers k such that d(k)^2 divides phi(k) + sigma(k).
- Nonprime numbers k for which phi(k) + sigma(k) is an integer multiple of the cube of the number of divisors of k.A055467
Nonprime numbers k for which phi(k) + sigma(k) is an integer multiple of the cube of the number of divisors of k.
- Composite numbers k for which phi(k) + sigma(k) is an integer multiple of the 4th power of the number of divisors of k.A055468
Composite numbers k for which phi(k) + sigma(k) is an integer multiple of the 4th power of the number of divisors of k.
- Primes of the form k(k+1)/2+1 (i.e., central polygonal numbers, or one more than triangular numbers).A055469
Primes of the form k(k+1)/2+1 (i.e., central polygonal numbers, or one more than triangular numbers).
- Smallest number x > 1 such that phi(x) + sigma(x) = k*d(x)^n, i.e., the left-hand side is divisible by the n-th power of the number of divisors.A055470
Smallest number x > 1 such that phi(x) + sigma(x) = k*d(x)^n, i.e., the left-hand side is divisible by the n-th power of the number of divisors.
- Divisible by the product of its nonzero digits.A055471
Divisible by the product of its nonzero digits.
- Primes of the form k(k+1)/2+2 (i.e., two more than a triangular number).A055472
Primes of the form k(k+1)/2+2 (i.e., two more than a triangular number).
- Powers of ten written in base 2.A055473
Powers of ten written in base 2.
- Powers of ten written in base 3.A055474
Powers of ten written in base 3.
- Powers of ten written in base 4.A055475
Powers of ten written in base 4.
- Powers of ten written in base 5.A055476
Powers of ten written in base 5.
- Powers of ten written in base 6.A055477
Powers of ten written in base 6.
- Powers of ten written in base 7.A055478
Powers of ten written in base 7.
- Powers of ten written in base 9.A055479
Powers of ten written in base 9.
- Energetic numbers.A055480
Energetic numbers.
- Numbers k for which there exists some m such that k = Sum_{i=1..1+floor(log_10(k))} binomial(m, d_i), where d_i is the i-th digit of k.A055481
Numbers k for which there exists some m such that k = Sum_{i=1..1+floor(log_10(k))} binomial(m, d_i), where d_i is the i-th digit of k.
- There exists some k>0 such that n is the product of (k + digits of n).A055482
There exists some k>0 such that n is the product of (k + digits of n).
- a(n) is the GCD of n and the reverse of n.A055483
a(n) is the GCD of n and the reverse of n.
- Number of unlabeled 3-element intersecting families (with not necessarily distinct sets) of an n-element set.A055484
Number of unlabeled 3-element intersecting families (with not necessarily distinct sets) of an n-element set.
- Number of unlabeled 3-element intersecting families (with distinct sets) of an n-element set.A055485
Number of unlabeled 3-element intersecting families (with distinct sets) of an n-element set.
- Number of solutions to sigma(x) = n!.A055486
Number of solutions to sigma(x) = n!.
- Least m such that phi(m) = n!.A055487
Least m such that phi(m) = n!.
- Smallest number x such that sum of divisors of x is n!.A055488
Smallest number x such that sum of divisors of x is n!.
- Largest number x such that sum of divisors of x is n!.A055489
Largest number x such that sum of divisors of x is n!.
- Factorial primes: primes of the form n! - 1.A055490
Factorial primes: primes of the form n! - 1.
- Smallest square divisible by n divided by largest square which divides n.A055491
Smallest square divisible by n divided by largest square which divides n.
- Numbers n such that LCM{1, ..., n} is a minimal number.A055492
Numbers n such that LCM{1, ..., n} is a minimal number.
- Numbers n such that Sum_{k=1..n} k! - 2 is prime.A055493
Numbers n such that Sum_{k=1..n} k! - 2 is prime.
- Numbers k such that k^2 - k + 1 is prime.A055494
Numbers k such that k^2 - k + 1 is prime.
- Numbers k such that there exists a pair of mutually orthogonal Latin squares of order k.A055495
Numbers k such that there exists a pair of mutually orthogonal Latin squares of order k.
- a(1) = 2; a(n) is smallest prime > 2*a(n-1).A055496
a(1) = 2; a(n) is smallest prime > 2*a(n-1).
- a(-1) = 4, a(0) = 5; thereafter a(n) = 4 + (Product_{k=1..n} prime(k))^2.A055497
a(-1) = 4, a(0) = 5; thereafter a(n) = 4 + (Product_{k=1..n} prime(k))^2.
- a(0)=0, a(1)=1, a(n) = smallest prime >= a(n-1) + a(n-2).A055498
a(0)=0, a(1)=1, a(n) = smallest prime >= a(n-1) + a(n-2).
- a(0)=0, a(1)=1, a(n) = smallest prime > a(n-1)+a(n-2).A055499
a(0)=0, a(1)=1, a(n) = smallest prime > a(n-1)+a(n-2).
- a(0)=1, a(1)=1, a(n) = largest prime <= a(n-1) + a(n-2).A055500
a(0)=1, a(1)=1, a(n) = largest prime <= a(n-1) + a(n-2).
- a(0)=1, a(1)=2, a(n) = largest prime < a(n-1)+a(n-2).A055501
a(0)=1, a(1)=2, a(n) = largest prime < a(n-1)+a(n-2).
- a(0)=0, a(1)=2, a(n) = smallest prime > a(n-1)+a(n-2).A055502
a(0)=0, a(1)=2, a(n) = smallest prime > a(n-1)+a(n-2).
- Take n points in general position in the plane; draw all the (infinite) straight lines joining them; sequence gives number of connected regions formed.A055503
Take n points in general position in the plane; draw all the (infinite) straight lines joining them; sequence gives number of connected regions formed.
- n*(n-1)*(n-2)*(n-3)*(n-4)*(2*n-1)/72.A055504
n*(n-1)*(n-2)*(n-3)*(n-4)*(2*n-1)/72.
- Numerators in expansion of (1-x)^(-1/x)/e.A055505
Numerators in expansion of (1-x)^(-1/x)/e.
- Number of solutions to the equation phi(x) = n!.A055506
Number of solutions to the equation phi(x) = n!.
- a(n) = Sum_{k=1..n} d(k)*d(n+1-k), where d(k) is number of positive divisors of k.A055507
a(n) = Sum_{k=1..n} d(k)*d(n+1-k), where d(k) is number of positive divisors of k.
- H is the first, fifth, sixteenth, ..., letter in the sequence not counting spaces and commas.A055508
H is the first, fifth, sixteenth, ..., letter in the sequence not counting spaces and commas.
- Number of odd primes in sequence obtained in 3x+1 (or Collatz) problem starting at n.A055509
Number of odd primes in sequence obtained in 3x+1 (or Collatz) problem starting at n.
- Largest odd prime in sequence obtained in 3x+1 (or Collatz) problem starting at n, or 0 if no such prime is found.A055510
Largest odd prime in sequence obtained in 3x+1 (or Collatz) problem starting at n, or 0 if no such prime is found.