Sequences
392,541 sequences
- Highly composite triangular numbers: triangular numbers where the number of divisors increases to a record.A076711
Highly composite triangular numbers: triangular numbers where the number of divisors increases to a record.
- Triangular numbers which are also happy numbers (cf. A007770).A076712
Triangular numbers which are also happy numbers (cf. A007770).
- Harshad (Niven) triangular numbers: triangular numbers which are divisible by the sum of their digits.A076713
Harshad (Niven) triangular numbers: triangular numbers which are divisible by the sum of their digits.
- Smallest k such that k^n + n^n + 1 is prime.A076714
Smallest k such that k^n + n^n + 1 is prime.
- Duplicate of A029549.A076715
Duplicate of A029549.
- Number of distinct factorizations of n! with all factors > 1.A076716
Number of distinct factorizations of n! with all factors > 1.
- a(n) = -Sum_{d|n} (-n/d)^d.A076717
a(n) = -Sum_{d|n} (-n/d)^d.
- Duplicate of A076671.A076718
Duplicate of A076671.
- Smallest k such that k^n - n^n + 1 is prime.A076719
Smallest k such that k^n - n^n + 1 is prime.
- Sum of product of divisors of n and sum of divisors of n.A076720
Sum of product of divisors of n and sum of divisors of n.
- Difference between product of divisors of n and sum of divisors of n.A076721
Difference between product of divisors of n and sum of divisors of n.
- Product of product of divisors of n and sum of divisors of n.A076722
Product of product of divisors of n and sum of divisors of n.
- Sum_{d divides n} (-d)^d.A076723
Sum_{d divides n} (-d)^d.
- Numbers m such that abs(Sum {k = 1..m} tau(k)) is a prime, where tau is the Ramanujan tau function (A000594).A076724
Numbers m such that abs(Sum {k = 1..m} tau(k)) is a prime, where tau is the Ramanujan tau function (A000594).
- a(n) = a(n-1)^2 + a(n-2)^4, a(0) = a(1) = 1.A076725
a(n) = a(n-1)^2 + a(n-2)^4, a(0) = a(1) = 1.
- a(n) = Sum_{k>=0} k^n/2^k.A076726
a(n) = Sum_{k>=0} k^n/2^k.
- Primes of the form x^2 + (x+3)^2.A076727
Primes of the form x^2 + (x+3)^2.
- a(n) = (n-1)^2 * n^(n-2).A076728
a(n) = (n-1)^2 * n^(n-2).
- a(n) = A001147(n+1) * Integral_{x=0..1} (1 + x^2)^n dx.A076729
a(n) = A001147(n+1) * Integral_{x=0..1} (1 + x^2)^n dx.
- Maximum number of (distinct) primes that an n-digit number may shelter (i.e., primes contained among all digital substrings' permutations).A076730
Maximum number of (distinct) primes that an n-digit number may shelter (i.e., primes contained among all digital substrings' permutations).
- Table T(n,k) giving number of ways of obtaining exactly 0 correct answers on an (n,k)-matching problem (1 <= k <= n).A076731
Table T(n,k) giving number of ways of obtaining exactly 0 correct answers on an (n,k)-matching problem (1 <= k <= n).
- Table T(n,k) giving number of ways of obtaining exactly one correct answer on an (n,k)-matching problem (1 <= k <= n).A076732
Table T(n,k) giving number of ways of obtaining exactly one correct answer on an (n,k)-matching problem (1 <= k <= n).
- Largest k such that k! divides C(2n,n).A076733
Largest k such that k! divides C(2n,n).
- Smallest squarefree number greater than or equal to n having the same number of prime factors as n (counted with multiplicity).A076734
Smallest squarefree number greater than or equal to n having the same number of prime factors as n (counted with multiplicity).
- Least k >= 2 such that k^n divides Sum_{i=1..k} i! * (k-i)!.A076735
Least k >= 2 such that k^n divides Sum_{i=1..k} i! * (k-i)!.
- Let u(1) = u(2) = u(3) = 2, u(n) = (1 + u(n-1)*u(n-2))/u(n-3); then a(n) is the denominator of u(n).A076736
Let u(1) = u(2) = u(3) = 2, u(n) = (1 + u(n-1)*u(n-2))/u(n-3); then a(n) is the denominator of u(n).
- Let u(1)=u(2)=u(3)=2, u(n)=(1+u(n-1)u(n-2))/u(n-3); then a(n) is the numerator of u(n).A076737
Let u(1)=u(2)=u(3)=2, u(n)=(1+u(n-1)u(n-2))/u(n-3); then a(n) is the numerator of u(n).
- Expansion of (1+2*x+6*x^2)/(1-9*x^3).A076738
Expansion of (1+2*x+6*x^2)/(1-9*x^3).
- Number of compositions of n into Fibonacci numbers (1 counted as single Fibonacci number).A076739
Number of compositions of n into Fibonacci numbers (1 counted as single Fibonacci number).
- a(n) = 2*a(n-1)^2 - a(n-2)^2 with a(0)=0, a(1)=1.A076740
a(n) = 2*a(n-1)^2 - a(n-2)^2 with a(0)=0, a(1)=1.
- Nonzero coefficients of the polynomials in the numerator of 1/(1+x^2) and its successive derivatives, starting with the constant term.A076741
Nonzero coefficients of the polynomials in the numerator of 1/(1+x^2) and its successive derivatives, starting with the constant term.
- Let u(1)=u(2)=1, u(n)=(2^floor(u(n-1)/2)+1)/u(n-2) then a(n) = numerator of u(n).A076742
Let u(1)=u(2)=1, u(n)=(2^floor(u(n-1)/2)+1)/u(n-2) then a(n) = numerator of u(n).
- Nonzero coefficients of the polynomials in the numerator of 1/(1+x^2) and its successive derivatives, starting with the highest power of x.A076743
Nonzero coefficients of the polynomials in the numerator of 1/(1+x^2) and its successive derivatives, starting with the highest power of x.
- Related to the expected length of the shortest nonintersecting path through n points on a Sierpiński Gasket from corner to corner.A076744
Related to the expected length of the shortest nonintersecting path through n points on a Sierpiński Gasket from corner to corner.
- a(n) = the least positive integer k such that b(k) = n, where b(k) (A076526) is defined by b(k) = r * max{e_1,...,e_r} if k = p_1^e_1 *...* p_r^e_r is the canonical prime factorization of k.A076745
a(n) = the least positive integer k such that b(k) = n, where b(k) (A076526) is defined by b(k) = r * max{e_1,...,e_r} if k = p_1^e_1 *...* p_r^e_r is the canonical prime factorization of k.
- List giving pairs of primes of the form 10k+3 and 10k+7.A076746
List giving pairs of primes of the form 10k+3 and 10k+7.
- List giving pairs of primes of the form 10k+3 and 10k+13.A076747
List giving pairs of primes of the form 10k+3 and 10k+13.
- Smallest k such that k*n+1 is a base-2 pseudoprime.A076748
Smallest k such that k*n+1 is a base-2 pseudoprime.
- Least number which is the sum of four nonnegative cubes (not necessarily distinct and including zero) in n ways.A076749
Least number which is the sum of four nonnegative cubes (not necessarily distinct and including zero) in n ways.
- Squares which are the product of a non-palindrome and its reversal, where leading zeros are not allowed.A076750
Squares which are the product of a non-palindrome and its reversal, where leading zeros are not allowed.
- a(n) is the smallest composite k such that Sum_{composites j = 4, ..., k} 1/j exceeds n.A076751
a(n) is the smallest composite k such that Sum_{composites j = 4, ..., k} 1/j exceeds n.
- a(n) = Sum_{d is a square divisor of n} n/d.A076752
a(n) = Sum_{d is a square divisor of n} n/d.
- a(n) = nearest integer to the standard deviation of the divisors of n.A076753
a(n) = nearest integer to the standard deviation of the divisors of n.
- a(n) = nearest integer to the skewness of the divisors of n.A076754
a(n) = nearest integer to the skewness of the divisors of n.
- Nearest integer to the kurtosis excess of the divisors of n.A076755
Nearest integer to the kurtosis excess of the divisors of n.
- Triangle of coefficients of characteristic polynomial of M_n, the n X n matrix M_(i,j) = min(i,j).A076756
Triangle of coefficients of characteristic polynomial of M_n, the n X n matrix M_(i,j) = min(i,j).
- Primes of the form n + pi(n), that is, generated in A077510.A076757
Primes of the form n + pi(n), that is, generated in A077510.
- a(n) = n*(n+1)^2*(2+n)*(3+2*n)*(19+8*n)/180.A076758
a(n) = n*(n+1)^2*(2+n)*(3+2*n)*(19+8*n)/180.
- 2-apexes of Omega: numbers k such that Omega(k-2)< Omega(k-1) < Omega(k) > Omega(k+1) > Omega(k+2), where Omega(m) = the number of prime factors of m, counting multiplicity.A076759
2-apexes of Omega: numbers k such that Omega(k-2)< Omega(k-1) < Omega(k) > Omega(k+1) > Omega(k+2), where Omega(m) = the number of prime factors of m, counting multiplicity.
- 3-apexes of Omega: numbers k such that Omega(k-3) < Omega(k-2)< Omega(k-1) < Omega(k) > Omega(k+1) > Omega(k+2) > Omega(k+3), where Omega(m) = the number of prime factors of m, counting multiplicity.A076760
3-apexes of Omega: numbers k such that Omega(k-3) < Omega(k-2)< Omega(k-1) < Omega(k) > Omega(k+1) > Omega(k+2) > Omega(k+3), where Omega(m) = the number of prime factors of m, counting multiplicity.