Sequences
392,541 sequences
- Triangle with T(n,k) = n^2 + k^2.A069011
Triangle with T(n,k) = n^2 + k^2.
- Number of distinct representations of n as the ratio A/B, where A and B taken together are pandigital (i.e., contains all digits 0 through 9 once).A069012
Number of distinct representations of n as the ratio A/B, where A and B taken together are pandigital (i.e., contains all digits 0 through 9 once).
- a(1)=a(2)=a(3)=1; for n > 3, a(n) = floor(a(n-3) + a(n-2)/a(n-1)).A069013
a(1)=a(2)=a(3)=1; for n > 3, a(n) = floor(a(n-3) + a(n-2)/a(n-1)).
- Integers n at which the difference between e^(Pi*sqrt(n)) and its nearest integer is a new minimum.A069014
Integers n at which the difference between e^(Pi*sqrt(n)) and its nearest integer is a new minimum.
- a(n) = n! * 3^n * Sum_{i=1..n} 1/(i * 3^i).A069015
a(n) = n! * 3^n * Sum_{i=1..n} 1/(i * 3^i).
- Look at all the different ways to factorize n as a product of numbers bigger than 1, and for each factorization write down the sum of the factors; a(n) = number of different sums.A069016
Look at all the different ways to factorize n as a product of numbers bigger than 1, and for each factorization write down the sum of the factors; a(n) = number of different sums.
- Triangular numbers of the form k^2 + k + 1.A069017
Triangular numbers of the form k^2 + k + 1.
- Smallest square k > 0 such that n*k + 1 is also a square or 0 if no such term exists, i.e., when n is a square.A069018
Smallest square k > 0 such that n*k + 1 is also a square or 0 if no such term exists, i.e., when n is a square.
- Smallest square k > 1 such that n*k + 1 is also a square or 0 if no such term exists, i.e., when n is a square.A069019
Smallest square k > 1 such that n*k + 1 is also a square or 0 if no such term exists, i.e., when n is a square.
- a(1) = 1; a(n) = smallest number of the form k*a(n-1) +1 divisible by n^2.A069020
a(1) = 1; a(n) = smallest number of the form k*a(n-1) +1 divisible by n^2.
- Start of the first occurrence of n consecutive numbers divisible by a square greater than 1.A069021
Start of the first occurrence of n consecutive numbers divisible by a square greater than 1.
- Start of the first occurrence of two consecutive numbers divisible by an n-th power.A069022
Start of the first occurrence of two consecutive numbers divisible by an n-th power.
- Define a subset of divisors of n to be a dedicated subset if the product of any two members is also a divisor of n. 1 is not allowed as a member as it gives trivially 1*d = d a divisor. a(n) is the number of dedicated subsets of divisors of n with at least two members.A069023
Define a subset of divisors of n to be a dedicated subset if the product of any two members is also a divisor of n. 1 is not allowed as a member as it gives trivially 1*d = d a divisor. a(n) is the number of dedicated subsets of divisors of n with at least two members.
- Numbers that are palindromic in base 2 as well as in base 10 (initial zeros may be prepended).A069024
Numbers that are palindromic in base 2 as well as in base 10 (initial zeros may be prepended).
- Smallest power of 2 with digital sum (A007953) n, or 0 if no such number exists.A069025
Smallest power of 2 with digital sum (A007953) n, or 0 if no such number exists.
- Smallest power of 4 with digit sum n, or 0 if no such number exists.A069026
Smallest power of 4 with digit sum n, or 0 if no such number exists.
- Powers of 2 with strictly increasing sum of digits.A069027
Powers of 2 with strictly increasing sum of digits.
- Powers of 3 with strictly increasing sum of digits.A069028
Powers of 3 with strictly increasing sum of digits.
- Powers of 4 with strictly increasing sum of digits.A069029
Powers of 4 with strictly increasing sum of digits.
- Powers of 5 with strictly increasing sum of digits.A069030
Powers of 5 with strictly increasing sum of digits.
- Powers of 6 with strictly increasing sum of digits.A069031
Powers of 6 with strictly increasing sum of digits.
- Powers of 7 with strictly increasing sum of digits.A069032
Powers of 7 with strictly increasing sum of digits.
- Powers of 8 with strictly increasing sum of digits.A069033
Powers of 8 with strictly increasing sum of digits.
- Powers of 9 with strictly increasing sum of digits.A069034
Powers of 9 with strictly increasing sum of digits.
- Smallest proper multiple of n with digit sum n.A069035
Smallest proper multiple of n with digit sum n.
- Smallest multiple of 2 with digit sum 2^n.A069036
Smallest multiple of 2 with digit sum 2^n.
- Smallest multiple of 4 with digit sum 4^n.A069037
Smallest multiple of 4 with digit sum 4^n.
- Expansion of g.f. x*(1+x)^4/(1-x)^6.A069038
Expansion of g.f. x*(1+x)^4/(1-x)^6.
- Expansion of g.f. x*(1+x)^5/(1-x)^7.A069039
Expansion of g.f. x*(1+x)^5/(1-x)^7.
- Numbers k that divide the numerator of B(2k) (the Bernoulli numbers).A069040
Numbers k that divide the numerator of B(2k) (the Bernoulli numbers).
- Fibonacci numbers with at most two distinct digits.A069041
Fibonacci numbers with at most two distinct digits.
- Numbers k such that A000364(k) == 1 (mod k^2).A069042
Numbers k such that A000364(k) == 1 (mod k^2).
- Composite numbers k with no prime factor among (2, 3) (cf. A038509) and such that phi(k) < 2*k/3.A069043
Composite numbers k with no prime factor among (2, 3) (cf. A038509) and such that phi(k) < 2*k/3.
- N(B(2*p))/p for p prime >= 5 and where N(B(2n)) are the numerators of Bernoulli numbers.A069044
N(B(2*p))/p for p prime >= 5 and where N(B(2n)) are the numerators of Bernoulli numbers.
- Denominator(sum(i=1,n,1/i^4))/denominator(sum(i=1,n,1/i)).A069045
Denominator(sum(i=1,n,1/i^4))/denominator(sum(i=1,n,1/i)).
- Denominator(sum(i=1,n,1/i^4))/denominator(sum(i=1,n,1/i^2)).A069046
Denominator(sum(i=1,n,1/i^4))/denominator(sum(i=1,n,1/i^2)).
- Denominator(sum(i=1,n,1/i^4))/denominator(sum(i=1,n,1/i^3)).A069047
Denominator(sum(i=1,n,1/i^4))/denominator(sum(i=1,n,1/i^3)).
- Numbers k such that (i) k is a concatenation of consecutive natural numbers starting at 1 and (ii) k+1 is prime.A069048
Numbers k such that (i) k is a concatenation of consecutive natural numbers starting at 1 and (ii) k+1 is prime.
- Numbers k such that 2^k mod k = 2^phi(k) mod phi(k).A069049
Numbers k such that 2^k mod k = 2^phi(k) mod phi(k).
- Numbers k such that 2^k mod phi(k) = 2^phi(k) mod k.A069050
Numbers k such that 2^k mod phi(k) = 2^phi(k) mod k.
- Primes p such that p-1 divides 2^p-2.A069051
Primes p such that p-1 divides 2^p-2.
- Denominator of Sum_{i = 1..n} 1/i^5.A069052
Denominator of Sum_{i = 1..n} 1/i^5.
- Denominator(sum(i=1,n,1/i^5))/denominator(sum(i=1,n,1/i^3)).A069053
Denominator(sum(i=1,n,1/i^5))/denominator(sum(i=1,n,1/i^3)).
- a(1)=0 a(2)=1 a(n)=concatenate(a(n-1)a(n-2)...a(1))-a(n-1).A069054
a(1)=0 a(2)=1 a(n)=concatenate(a(n-1)a(n-2)...a(1))-a(n-1).
- Largest n-digit number with only prime divisors 2 or 3 (i.e., of the form 2^a * 3^b).A069055
Largest n-digit number with only prime divisors 2 or 3 (i.e., of the form 2^a * 3^b).
- Numbers k such that Sum_{d|k} d^2*mu(d) divides k^2.A069056
Numbers k such that Sum_{d|k} d^2*mu(d) divides k^2.
- Numbers k such that the numerator of Sum_{d|k} 1/d > 2k.A069057
Numbers k such that the numerator of Sum_{d|k} 1/d > 2k.
- Numbers n such that A017666(n)=phi(n).A069058
Numbers n such that A017666(n)=phi(n).
- Numbers k such that k and sigma(k) are not relatively prime.A069059
Numbers k such that k and sigma(k) are not relatively prime.
- Product of divisors of 2^n + 1.A069060
Product of divisors of 2^n + 1.