Sequences
392,541 sequences
- a(n) = 2^n + 2*n - 1.A061761
a(n) = 2^n + 2*n - 1.
- a(n) = (sum of digits of n) + (product of digits of n).A061762
a(n) = (sum of digits of n) + (product of digits of n).
- Numbers k such that k is divisible by A061762(k) and the product of digits of k (A007954(k)) is not zero.A061763
Numbers k such that k is divisible by A061762(k) and the product of digits of k (A007954(k)) is not zero.
- Positive integers k such that k! is divisible by (k+1)^12.A061764
Positive integers k such that k! is divisible by (k+1)^12.
- a(n) = usigma(sigma(n)), where usigma(n) is the sum of unitary divisors of n (A034448) and sigma(n) is the sum of the divisors (A000203).A061765
a(n) = usigma(sigma(n)), where usigma(n) is the sum of unitary divisors of n (A034448) and sigma(n) is the sum of the divisors (A000203).
- a(1) = 4; a(n) = smallest composite number of the form k*a(n-1) + 1.A061766
a(1) = 4; a(n) = smallest composite number of the form k*a(n-1) + 1.
- a(n) = smallest composite number of the form k*n + 1.A061767
a(n) = smallest composite number of the form k*n + 1.
- k is the least number such that k! is divisible by (k+1)^n.A061768
k is the least number such that k! is divisible by (k+1)^n.
- The least number k = a(n) > a(n-1) for which k!/(k+1)^m for increasing m's.A061769
The least number k = a(n) > a(n-1) for which k!/(k+1)^m for increasing m's.
- Numbers m = a(n) > a(n-1) such that there exists a smallest integer k > 1 such that k!/(k+1)^m is an integer.A061770
Numbers m = a(n) > a(n-1) such that there exists a smallest integer k > 1 such that k!/(k+1)^m is an integer.
- Primes p(k) such that p(k+1) - p(k) = 2^m for some m (smaller of a pair of consecutive primes which differ by a power of 2).A061771
Primes p(k) such that p(k+1) - p(k) = 2^m for some m (smaller of a pair of consecutive primes which differ by a power of 2).
- a(n) is the number of n-digit multiples of n.A061772
a(n) is the number of n-digit multiples of n.
- Triangle in which n-th row lists Matula-Goebel numbers for all rooted trees with n nodes.A061773
Triangle in which n-th row lists Matula-Goebel numbers for all rooted trees with n nodes.
- (m-1)!, as m runs through the prime powers >= 1.A061774
(m-1)!, as m runs through the prime powers >= 1.
- Number of nodes in rooted tree with Matula-Goebel number n.A061775
Number of nodes in rooted tree with Matula-Goebel number n.
- Start with a single triangle; at n-th generation add a triangle at each vertex, allowing triangles to overlap; sequence gives number of triangles in n-th generation.A061776
Start with a single triangle; at n-th generation add a triangle at each vertex, allowing triangles to overlap; sequence gives number of triangles in n-th generation.
- Start with a single triangle; at n-th generation add a triangle at each vertex, allowing triangles to overlap; sequence gives total population of triangles at n-th generation.A061777
Start with a single triangle; at n-th generation add a triangle at each vertex, allowing triangles to overlap; sequence gives total population of triangles at n-th generation.
- a(n) = Product_{j=0..floor(n/2)} binomial(n,j).A061778
a(n) = Product_{j=0..floor(n/2)} binomial(n,j).
- Primes p such that q-p = 22, where q is the next prime after p.A061779
Primes p such that q-p = 22, where q is the next prime after p.
- Number of solutions to x + y + z = 0 mod (2n+1) such that x,y,z are units modulo 2n+1, i.e., gcd(x, 2n+1) = gcd(y, 2n+1) = gcd(z, 2n+1) = 1.A061780
Number of solutions to x + y + z = 0 mod (2n+1) such that x,y,z are units modulo 2n+1, i.e., gcd(x, 2n+1) = gcd(y, 2n+1) = gcd(z, 2n+1) = 1.
- Number of distinct sums p(i) + p(j) for 1<=i<=j<=n, p(k) = k-th prime.A061781
Number of distinct sums p(i) + p(j) for 1<=i<=j<=n, p(k) = k-th prime.
- a(n) = smallest positive number m such that m*n is a triangular number.A061782
a(n) = smallest positive number m such that m*n is a triangular number.
- Luhn primes: primes p such that p + (p reversed) is also a prime.A061783
Luhn primes: primes p such that p + (p reversed) is also a prime.
- Number of sums prime(i) + prime(j) that occur more than once for 1 <= i <= j <= n, where prime(k) = k-th prime.A061784
Number of sums prime(i) + prime(j) that occur more than once for 1 <= i <= j <= n, where prime(k) = k-th prime.
- a(n) = m such that 2^m < 5^n < 2^(m+1).A061785
a(n) = m such that 2^m < 5^n < 2^(m+1).
- Number of distinct sums i^2 + j^2 for 1<=i<=j<=n.A061786
Number of distinct sums i^2 + j^2 for 1<=i<=j<=n.
- a(n) = Sum_{k=1..n} (2k-1)^(2k-1).A061787
a(n) = Sum_{k=1..n} (2k-1)^(2k-1).
- a(n) = Sum_{k=1..n} (2k)^(2k).A061788
a(n) = Sum_{k=1..n} (2k)^(2k).
- a(n) = Sum_{k=1..n} prime(k)^prime(k).A061789
a(n) = Sum_{k=1..n} prime(k)^prime(k).
- a(n) = A000217(n) - A061786(n).A061790
a(n) = A000217(n) - A061786(n).
- Number of distinct sums i^3 + j^3 for 1<=i<=j<=n.A061791
Number of distinct sums i^3 + j^3 for 1<=i<=j<=n.
- a(n) = 49*(n*(n+1)/2) + 6.A061792
a(n) = 49*(n*(n+1)/2) + 6.
- a(n) = 25*n*(n + 1)/2 + 3.A061793
a(n) = 25*n*(n + 1)/2 + 3.
- Number of distinct sums d(i) + d(j) for 1<=i<=j<=n, d(k) = A000005(k) = number of divisors function.A061794
Number of distinct sums d(i) + d(j) for 1<=i<=j<=n, d(k) = A000005(k) = number of divisors function.
- Number of distinct sums phi(i) + phi(j) for 1 <= i <= j <= n, phi(k) = A000010(k).A061795
Number of distinct sums phi(i) + phi(j) for 1 <= i <= j <= n, phi(k) = A000010(k).
- Number of distinct sums sigma(i) + sigma(j) for 1<=i<=j<=n, where sigma(k) = A000203(k).A061796
Number of distinct sums sigma(i) + sigma(j) for 1<=i<=j<=n, where sigma(k) = A000203(k).
- Smallest k such that k*n has even digits and is a palindrome or becomes a palindrome when 0's are added on the left.A061797
Smallest k such that k*n has even digits and is a palindrome or becomes a palindrome when 0's are added on the left.
- Number of sums i^3 + j^3 that occur more than once for 1<=i<=j<=n.A061798
Number of sums i^3 + j^3 that occur more than once for 1<=i<=j<=n.
- Smallest number with at least n divisors.A061799
Smallest number with at least n divisors.
- a(n) = n + (-1)^(n mod 3).A061800
a(n) = n + (-1)^(n mod 3).
- a(n) = (7*6^n - 2)/5.A061801
a(n) = (7*6^n - 2)/5.
- Sum of n-th row of triangle of primes: 2; 2 3 2; 2 3 5 3 2; 2 3 5 7 5 3 2; ...; where n-th row contains 2n+1 terms.A061802
Sum of n-th row of triangle of primes: 2; 2 3 2; 2 3 5 3 2; 2 3 5 7 5 3 2; ...; where n-th row contains 2n+1 terms.
- Sum of n-th row of triangle of 4th powers: 1; 1 16 1; 1 16 81 16 1; 1 16 81 256 81 16 1; ... (cf. A133824).A061803
Sum of n-th row of triangle of 4th powers: 1; 1 16 1; 1 16 81 16 1; 1 16 81 256 81 16 1; ... (cf. A133824).
- a(n) = 2*n*(2*n^2 + 1).A061804
a(n) = 2*n*(2*n^2 + 1).
- Smallest number that has digits in order ...123...901... and is divisible by n. If no such number exists then a(n) = 0.A061805
Smallest number that has digits in order ...123...901... and is divisible by n. If no such number exists then a(n) = 0.
- Numbers n such that the iterative cycle: n -> sum of digits of n^2 has only three distinct elements.A061806
Numbers n such that the iterative cycle: n -> sum of digits of n^2 has only three distinct elements.
- Smallest positive multiple of n containing only even digits.A061807
Smallest positive multiple of n containing only even digits.
- a(n) is the smallest number with all digits odd that is divisible by 2n-1.A061808
a(n) is the smallest number with all digits odd that is divisible by 2n-1.
- When cubed gives number composed just of the digits 1, 2, 3, 4.A061809
When cubed gives number composed just of the digits 1, 2, 3, 4.
- Multiples of 3 with all odd digits.A061810
Multiples of 3 with all odd digits.