Sequences
392,541 sequences
- Average digit (rounded down) in the decimal expansion of the n-th prime number.A074461
Average digit (rounded down) in the decimal expansion of the n-th prime number.
- Average digit (rounded up) in the decimal expansion of prime(n).A074462
Average digit (rounded up) in the decimal expansion of prime(n).
- Average digit (rounded up) in the decimal expansion of a prime number p, where 2^p-1 is a Mersenne prime.A074463
Average digit (rounded up) in the decimal expansion of a prime number p, where 2^p-1 is a Mersenne prime.
- Average digit (rounded down) in the decimal expansion of a prime number p, where 2^p-1 is a Mersenne prime.A074464
Average digit (rounded down) in the decimal expansion of a prime number p, where 2^p-1 is a Mersenne prime.
- a(n) = gcd(n^2, sigma(n^2), phi(n^2)).A074465
a(n) = gcd(n^2, sigma(n^2), phi(n^2)).
- a(n) = gcd(n^3, sigma(n^3), phi(n^3)).A074466
a(n) = gcd(n^3, sigma(n^3), phi(n^3)).
- Least k such that Sum_{i=1..k} 1/phi(i) >= n.A074467
Least k such that Sum_{i=1..k} 1/phi(i) >= n.
- Least number m such that the Sigma-Harmonic sequence Sum_{k=1..m} 1/sigma(k) >= n.A074468
Least number m such that the Sigma-Harmonic sequence Sum_{k=1..m} 1/sigma(k) >= n.
- Least m such that Sigma-Composite-Harmonic series Sum_{k=1..m} 1/A000203(A002808(k)) >= n.A074469
Least m such that Sigma-Composite-Harmonic series Sum_{k=1..m} 1/A000203(A002808(k)) >= n.
- Least m such that Phi-Composite-Harmonic series Sum_{k=1..m} 1/A000010(A002808(k)) >= n.A074470
Least m such that Phi-Composite-Harmonic series Sum_{k=1..m} 1/A000010(A002808(k)) >= n.
- Sum of 2nd, 4th, 6th, 8th and 10th powers of divisors are divisible by sum of divisors.A074471
Sum of 2nd, 4th, 6th, 8th and 10th powers of divisors are divisible by sum of divisors.
- Length of iteration sequence of Collatz-function (A006370) when initial value is 3^n (A000244) and final cycle is followed once.A074472
Length of iteration sequence of Collatz-function (A006370) when initial value is 3^n (A000244) and final cycle is followed once.
- Dropping time for the 3x+1 problem: for n >= 2, number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated starting at n; a(1)=1 by convention.A074473
Dropping time for the 3x+1 problem: for n >= 2, number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated starting at n; a(1)=1 by convention.
- Number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated, starting with numbers of form 4n+3.A074474
Number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated, starting with numbers of form 4n+3.
- a(n) = Sum_{j=0..floor(n/2)} T(2*j + q), where T(n) are generalized tribonacci numbers (A001644) and q = n - 2*floor(n/2).A074475
a(n) = Sum_{j=0..floor(n/2)} T(2*j + q), where T(n) are generalized tribonacci numbers (A001644) and q = n - 2*floor(n/2).
- Largest prime factor of 3^n + 1.A074476
Largest prime factor of 3^n + 1.
- Largest prime factor of 3^n - 1.A074477
Largest prime factor of 3^n - 1.
- Largest prime factor of 5^n + 1.A074478
Largest prime factor of 5^n + 1.
- Largest prime factor of 5^n - 1.A074479
Largest prime factor of 5^n - 1.
- Multiplicative closure of twin prime pair products (A037074).A074480
Multiplicative closure of twin prime pair products (A037074).
- Triangle T(p,k) read by rows, where p runs through the primes and 1 <= k <= p-1. T(p,k) = 1 if the reverse of the base-k expansion of p is a prime, otherwise 0.A074481
Triangle T(p,k) read by rows, where p runs through the primes and 1 <= k <= p-1. T(p,k) = 1 if the reverse of the base-k expansion of p is a prime, otherwise 0.
- Consider the recursion b(1,n) = 1, b(k+1,n) = b(k,n) + (b(k,n) reduced mod(k+n)); then there is a number x such that b(k,n) - b(k-1,n) is a constant x depending only on n, for k > y = A074483(n). Sequence gives values of x.A074482
Consider the recursion b(1,n) = 1, b(k+1,n) = b(k,n) + (b(k,n) reduced mod(k+n)); then there is a number x such that b(k,n) - b(k-1,n) is a constant x depending only on n, for k > y = A074483(n). Sequence gives values of x.
- Consider the recursion b(1,n) = 1, b(k+1,n) = b(k,n) + (b(k,n) reduced mod(k+n)); then there is a number y such that b(k,n)-b(k-1,n) is a constant (= A074482(n)) for k > y. Sequence gives values of y.A074483
Consider the recursion b(1,n) = 1, b(k+1,n) = b(k,n) + (b(k,n) reduced mod(k+n)); then there is a number y such that b(k,n)-b(k-1,n) is a constant (= A074482(n)) for k > y. Sequence gives values of y.
- a(n) = b(A074483(n), n), where b(k) is the recursion: b(1,n)=1, b(k+1,n)=b(k,n) + (b(k,n) reduced mod(k+n)) (cf. A074482).A074484
a(n) = b(A074483(n), n), where b(k) is the recursion: b(1,n)=1, b(k+1,n)=b(k,n) + (b(k,n) reduced mod(k+n)) (cf. A074482).
- Bases k for which the smallest (Fermat) pseudoprime greater than k has Moebius function mu = -1.A074485
Bases k for which the smallest (Fermat) pseudoprime greater than k has Moebius function mu = -1.
- Encoding of topologies generated by classes of sets.A074486
Encoding of topologies generated by classes of sets.
- a(1)=1, then "jump over next square": a(n) = 2*(a(n-1)+1)^2-a(n-1).A074487
a(1)=1, then "jump over next square": a(n) = 2*(a(n-1)+1)^2-a(n-1).
- a(1)=1, then "jump over next cube": a(n) = 2*(a(n-1)+1)^3-a(n-1).A074488
a(1)=1, then "jump over next cube": a(n) = 2*(a(n-1)+1)^3-a(n-1).
- n-th power of the largest n-digit prime.A074489
n-th power of the largest n-digit prime.
- n-th power of the smallest n-digit prime.A074490
n-th power of the smallest n-digit prime.
- "Squarefree" primes: primes without squares in their decimal expansion.A074491
"Squarefree" primes: primes without squares in their decimal expansion.
- Duplicate of A059307.A074492
Duplicate of A059307.
- Numbers n such that all the divisors of n appear as substrings in n^3.A074493
Numbers n such that all the divisors of n appear as substrings in n^3.
- Number of 2-input gates used to synthesize parity function in disjunctive normal form (DNF) with n inputs.A074494
Number of 2-input gates used to synthesize parity function in disjunctive normal form (DNF) with n inputs.
- a(n) = the first prime > sigma(n).A074495
a(n) = the first prime > sigma(n).
- a(n) = smallest prime > e^n.A074496
a(n) = smallest prime > e^n.
- a(n) = the smallest prime > Pi^n.A074497
a(n) = the smallest prime > Pi^n.
- Odd numbers which retain their relative position in A074368 (not disturbed in the rearrangement process).A074498
Odd numbers which retain their relative position in A074368 (not disturbed in the rearrangement process).
- Sum of three perfect powers.A074499
Sum of three perfect powers.
- Difference between n*sqrt(n)+1 and prime(n), rounded to nearest integer.A074500
Difference between n*sqrt(n)+1 and prime(n), rounded to nearest integer.
- a(n) = 1^n + 2^n + 5^n.A074501
a(n) = 1^n + 2^n + 5^n.
- a(n) = 1^n + 2^n + 6^n.A074502
a(n) = 1^n + 2^n + 6^n.
- a(n) = 1^n + 2^n + 7^n.A074503
a(n) = 1^n + 2^n + 7^n.
- a(n) = 1^n + 2^n + 8^n.A074504
a(n) = 1^n + 2^n + 8^n.
- a(n) = 1^n + 2^n + 9^n.A074505
a(n) = 1^n + 2^n + 9^n.
- a(n) = 1^n + 3^n + 4^n.A074506
a(n) = 1^n + 3^n + 4^n.
- a(n) = 1^n + 3^n + 5^n.A074507
a(n) = 1^n + 3^n + 5^n.
- a(n) = 1^n + 3^n + 6^n.A074508
a(n) = 1^n + 3^n + 6^n.
- a(n) = 1^n + 3^n + 7^n.A074509
a(n) = 1^n + 3^n + 7^n.
- a(n) = 1^n + 3^n + 8^n.A074510
a(n) = 1^n + 3^n + 8^n.