Sequences
392,541 sequences
- a(1) = 1; a(2) = 2; a(n) = smallest number greater than the previous term such that the average of three successive terms is a prime.A074311
a(1) = 1; a(2) = 2; a(n) = smallest number greater than the previous term such that the average of three successive terms is a prime.
- Numbers k such that the product of the digits of k equals the number of divisors of k.A074312
Numbers k such that the product of the digits of k equals the number of divisors of k.
- a(n) = the maximal length of a sequence of primes {s_1 = prime(n), s_2 = f(s1), s_3 = f(s_2), ....} formed by repeated application of f(m) = Floor(m/2) on prime(n).A074313
a(n) = the maximal length of a sequence of primes {s_1 = prime(n), s_2 = f(s1), s_3 = f(s_2), ....} formed by repeated application of f(m) = Floor(m/2) on prime(n).
- Deficient triangular numbers.A074314
Deficient triangular numbers.
- Abundant triangular numbers.A074315
Abundant triangular numbers.
- Abundant Fibonacci numbers.A074316
Abundant Fibonacci numbers.
- Deficient Fibonacci numbers.A074317
Deficient Fibonacci numbers.
- Sum of next n^n terms of the form i^i.A074318
Sum of next n^n terms of the form i^i.
- Product of next n factorials.A074319
Product of next n factorials.
- a(n) = sum of smallest and largest prime factors of n, for n>1; a(1)=2.A074320
a(n) = sum of smallest and largest prime factors of n, for n>1; a(1)=2.
- Numbers n such that n-th perfect power + n is prime: n + A001597(n) is prime.A074321
Numbers n such that n-th perfect power + n is prime: n + A001597(n) is prime.
- 0 if pronounced name of n-th letter of English alphabet begin with a vowel sound, otherwise 1. Different from A054638.A074322
0 if pronounced name of n-th letter of English alphabet begin with a vowel sound, otherwise 1. Different from A054638.
- Coefficient of the highest power of q in the expansion of nu(0)=1, nu(1)=b and for n>=2, nu(n)=b*nu(n-1)+lambda*(n-1)_q*nu(n-2) with (b,lambda)=(1,2), where (n)_q=(1+q+...+q^(n-1)) and q is a root of unity.A074323
Coefficient of the highest power of q in the expansion of nu(0)=1, nu(1)=b and for n>=2, nu(n)=b*nu(n-1)+lambda*(n-1)_q*nu(n-2) with (b,lambda)=(1,2), where (n)_q=(1+q+...+q^(n-1)) and q is a root of unity.
- a(2n+1) = 3^n, a(2n) = 4*3^(n-1) except for a(0) = 1.A074324
a(2n+1) = 3^n, a(2n) = 4*3^(n-1) except for a(0) = 1.
- Difference between (1+2^n)-th and (2^n)-th primes. Also number of terms in blocks of A073798.A074325
Difference between (1+2^n)-th and (2^n)-th primes. Also number of terms in blocks of A073798.
- Numbers n such that difference between (1+2^n)-th and (2^n)-th primes is 2.A074326
Numbers n such that difference between (1+2^n)-th and (2^n)-th primes is 2.
- Smaller of twin primes arising in A074326.A074327
Smaller of twin primes arising in A074326.
- Numbers m such that prime(m^2+1)-prime(m^2)=2, where prime(j) is the j-th prime.A074328
Numbers m such that prime(m^2+1)-prime(m^2)=2, where prime(j) is the j-th prime.
- The n-th highly composite number equals the a(n)-th composite number, for n >= 3.A074329
The n-th highly composite number equals the a(n)-th composite number, for n >= 3.
- a(n) = Sum_{k=1..n} 2^b(k) where b(k) denotes the number of 1's in the binary representation of k.A074330
a(n) = Sum_{k=1..n} 2^b(k) where b(k) denotes the number of 1's in the binary representation of k.
- a(n) = Fibonacci(n+1) - (1 + (-1)^n)/2.A074331
a(n) = Fibonacci(n+1) - (1 + (-1)^n)/2.
- Direction from n-th perfect power to closest prime (-1 if down, 1 if up, 0 if two primes are closest).A074332
Direction from n-th perfect power to closest prime (-1 if down, 1 if up, 0 if two primes are closest).
- a(n+1) = a(n) + (a(n))^3 with a(0)=1.A074333
a(n+1) = a(n) + (a(n))^3 with a(0)=1.
- a(n) = Sum_{r=1..n} r^4*binomial(n,r)^2.A074334
a(n) = Sum_{r=1..n} r^4*binomial(n,r)^2.
- In music, with 0 = C natural, 1 = C#, etc.: The unfolding of a semitonal interval cycle, alternating the ascending and descending aspects of the cycle from a common point or axis of symmetry. Any regularly occurring alignment may be used, with predictable even or odd results.A074335
In music, with 0 = C natural, 1 = C#, etc.: The unfolding of a semitonal interval cycle, alternating the ascending and descending aspects of the cycle from a common point or axis of symmetry. Any regularly occurring alignment may be used, with predictable even or odd results.
- a(1) = 1; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.A074336
a(1) = 1; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.
- 18 primes in arithmetic progression.A074337
18 primes in arithmetic progression.
- a(1) = 2; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.A074338
a(1) = 2; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.
- a(1) = 3; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.A074339
a(1) = 3; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.
- a(1) = 5; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.A074340
a(1) = 5; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.
- a(1) = 4; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.A074341
a(1) = 4; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.
- a(1) = 6; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.A074342
a(1) = 6; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.
- a(1) = 7; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.A074343
a(1) = 7; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.
- a(1) = 8; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.A074344
a(1) = 8; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.
- a(1) = 9; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.A074345
a(1) = 9; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.
- a(1) = 10; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.A074346
a(1) = 10; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.
- Smallest number requiring n steps to reach 0 when iterating the function: f(n)=abs(lpd(n)-Lpf(n)), where lpd(n) is the largest proper divisor of n and Lpf(n) is the largest prime factor of n.A074347
Smallest number requiring n steps to reach 0 when iterating the function: f(n)=abs(lpd(n)-Lpf(n)), where lpd(n) is the largest proper divisor of n and Lpf(n) is the largest prime factor of n.
- Smallest number requiring n steps to reach 0 or -1 when iterating the function: f(n)=lcd(n)-lpf(n), where lcd(n) is the largest common difference between consecutive divisors of n (ordered by size) and lpf(n) is the largest prime factor of n.A074348
Smallest number requiring n steps to reach 0 or -1 when iterating the function: f(n)=lcd(n)-lpf(n), where lcd(n) is the largest common difference between consecutive divisors of n (ordered by size) and lpf(n) is the largest prime factor of n.
- a(1)=1, a(4)=97, otherwise a(n) is smallest number > a(n-1) such that all pair juxtapositions a(1)a(n),...,a(n-1)a(n) are primes.A074349
a(1)=1, a(4)=97, otherwise a(n) is smallest number > a(n-1) such that all pair juxtapositions a(1)a(n),...,a(n-1)a(n) are primes.
- Numbers n such that n and the n-th prime have the same digits.A074350
Numbers n such that n and the n-th prime have the same digits.
- Number of elements of S_n having order n.A074351
Number of elements of S_n having order n.
- Coefficient of q^1 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,2).A074352
Coefficient of q^1 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,2).
- Coefficient of q^2 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,2).A074353
Coefficient of q^2 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,2).
- Coefficient of q^3 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,2).A074354
Coefficient of q^3 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,2).
- Coefficient of q^1 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,3).A074355
Coefficient of q^1 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,3).
- Coefficient of q^2 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,3).A074356
Coefficient of q^2 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,3).
- Coefficient of q^3 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,3).A074357
Coefficient of q^3 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,3).
- Coefficient of q^1 in nu(n), where nu(0)=1, nu(1)=b and, for n >= 2, nu(n) = b*nu(n-1) + lambda*(1 + q + q^2 + ... + q^(n-2))*nu(n-2) with (b,lambda)=(2,2).A074358
Coefficient of q^1 in nu(n), where nu(0)=1, nu(1)=b and, for n >= 2, nu(n) = b*nu(n-1) + lambda*(1 + q + q^2 + ... + q^(n-2))*nu(n-2) with (b,lambda)=(2,2).
- Coefficient of q^2 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(2,2).A074359
Coefficient of q^2 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(2,2).
- Coefficient of q^3 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(2,2).A074360
Coefficient of q^3 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(2,2).