Sequences
392,541 sequences
- Smallest prime p such that the least positive primitive root of p equals prime(n).A079061
Smallest prime p such that the least positive primitive root of p equals prime(n).
- a(1) = 2; for n>1, a(n) = smallest prime p such that p - a(n-1) = c^e for some positive integers c,e > 1.A079062
a(1) = 2; for n>1, a(n) = smallest prime p such that p - a(n-1) = c^e for some positive integers c,e > 1.
- Least k such that sqrt(prime(n+k))-sqrt(prime(n))>1.A079063
Least k such that sqrt(prime(n+k))-sqrt(prime(n))>1.
- a(n) is the next available entirely straight or curved number, depending on whether n contains a straight digit or not.A079064
a(n) is the next available entirely straight or curved number, depending on whether n contains a straight digit or not.
- In prime factorization of n replace odd primes with 3.A079065
In prime factorization of n replace odd primes with 3.
- "Memory" of prime(n): the number of distinct (previous) primes contained as substrings in prime(n).A079066
"Memory" of prime(n): the number of distinct (previous) primes contained as substrings in prime(n).
- Number of primes less than greatest prime factor of n but not dividing n.A079067
Number of primes less than greatest prime factor of n but not dividing n.
- Largest prime less than greatest prime factor of n but not dividing n, or 1 if no such prime exists.A079068
Largest prime less than greatest prime factor of n but not dividing n, or 1 if no such prime exists.
- a(n) = a(n-2) * a(n-3) + a(n-3), n>3. a(1) = a(2) = a(3) = 1.A079069
a(n) = a(n-2) * a(n-3) + a(n-3), n>3. a(1) = a(2) = a(3) = 1.
- Number of numbers < n having in binary representation the same number of 0's as n.A079070
Number of numbers < n having in binary representation the same number of 0's as n.
- Number of numbers < n whose binary representation has the same number of 0's and 1's as n does.A079071
Number of numbers < n whose binary representation has the same number of 0's and 1's as n does.
- Sum of numbers < n having in binary representation the same number of 0's as n.A079072
Sum of numbers < n having in binary representation the same number of 0's as n.
- Sum of numbers < n having in binary representation the same number of 1's as n.A079073
Sum of numbers < n having in binary representation the same number of 1's as n.
- Sum of numbers < n having in binary representation the same number of 0's and 1's as n.A079074
Sum of numbers < n having in binary representation the same number of 0's and 1's as n.
- "Memory" of fibonacci(n): the number of (previous) Fibonacci numbers contained as substrings in fibonacci(n).A079075
"Memory" of fibonacci(n): the number of (previous) Fibonacci numbers contained as substrings in fibonacci(n).
- Numerator of Sum_{1<k<n, n mod k > 0} n/k.A079076
Numerator of Sum_{1<k<n, n mod k > 0} n/k.
- Duplicate of A027611.A079077
Duplicate of A027611.
- a(0) = 1, a(1) = 2; for n > 1, a(n) = prime(n)*a(n-2).A079078
a(0) = 1, a(1) = 2; for n > 1, a(n) = prime(n)*a(n-2).
- a(n) = (prime(n)+1)*(prime(n+1)+1)/4.A079079
a(n) = (prime(n)+1)*(prime(n+1)+1)/4.
- a(n) = gcd((prime(n)+1)*(prime(n+1)+1)/4, prime(n)*prime(n+1)+1).A079080
a(n) = gcd((prime(n)+1)*(prime(n+1)+1)/4, prime(n)*prime(n+1)+1).
- Numerator of (prime(n)+1)*(prime(n+1)+1)/(4*(prime(n)*prime(n+1)+1)).A079081
Numerator of (prime(n)+1)*(prime(n+1)+1)/(4*(prime(n)*prime(n+1)+1)).
- Denominator of (prime(n)+1)*(prime(n+1)+1)/(4*(prime(n)*prime(n+1)+1)).A079082
Denominator of (prime(n)+1)*(prime(n+1)+1)/(4*(prime(n)*prime(n+1)+1)).
- Smallest odd prime factor of (prime(n)+1)*(prime(n+1)+1)/4.A079083
Smallest odd prime factor of (prime(n)+1)*(prime(n+1)+1)/4.
- Greatest prime factor of (prime(n)+1)*(prime(n+1)+1)/4.A079084
Greatest prime factor of (prime(n)+1)*(prime(n+1)+1)/4.
- Number of distinct prime factors of (prime(n)+1)*(prime(n+1)+1)/4.A079085
Number of distinct prime factors of (prime(n)+1)*(prime(n+1)+1)/4.
- Total number of prime factors of (prime(n)+1)*(prime(n+1)+1)/4.A079086
Total number of prime factors of (prime(n)+1)*(prime(n+1)+1)/4.
- Maximum exponent in prime factorization of (prime(n)+1)*(prime(n+1)+1)/4.A079087
Maximum exponent in prime factorization of (prime(n)+1)*(prime(n+1)+1)/4.
- Number of divisors of (prime(n)+1)*(prime(n+1)+1)/4.A079088
Number of divisors of (prime(n)+1)*(prime(n+1)+1)/4.
- Sum of divisors of (prime(n)+1)*(prime(n+1)+1)/4.A079089
Sum of divisors of (prime(n)+1)*(prime(n+1)+1)/4.
- Sum of distinct prime factors of (prime(n)+1)*(prime(n+1)+1)/4.A079090
Sum of distinct prime factors of (prime(n)+1)*(prime(n+1)+1)/4.
- Sum of all prime factors of (prime(n)+1)*(prime(n+1)+1)/4.A079091
Sum of all prime factors of (prime(n)+1)*(prime(n+1)+1)/4.
- Euler's totient of (prime(n)+1)*(prime(n+1)+1)/4.A079092
Euler's totient of (prime(n)+1)*(prime(n+1)+1)/4.
- Squarefree kernel of (prime(n)+1)*(prime(n+1)+1)/4.A079093
Squarefree kernel of (prime(n)+1)*(prime(n+1)+1)/4.
- Arithmetic derivative of (prime(n)+1)*(prime(n+1)+1)/4.A079094
Arithmetic derivative of (prime(n)+1)*(prime(n+1)+1)/4.
- Squarefree numbers of the form (prime(k)+1)*(prime(k+1)+1)/4.A079095
Squarefree numbers of the form (prime(k)+1)*(prime(k+1)+1)/4.
- Erroneous version of A143293.A079096
Erroneous version of A143293.
- Mix odd numbers and squares.A079097
Mix odd numbers and squares.
- Conjectured values of greatest k such that for any consecutive primes q, q', k <= q < q', sqrt(q')-sqrt(q) < 1/n.A079098
Conjectured values of greatest k such that for any consecutive primes q, q', k <= q < q', sqrt(q')-sqrt(q) < 1/n.
- Number of 0's in n primorial or 0's in A002110(n).A079099
Number of 0's in n primorial or 0's in A002110(n).
- Number of 1's in n# (n primorial) = 1's in A002110(n).A079100
Number of 1's in n# (n primorial) = 1's in A002110(n).
- A repetition-resistant sequence.A079101
A repetition-resistant sequence.
- a(2n) = 2^n, a(2n+1) = 2^(2n).A079102
a(2n) = 2^n, a(2n+1) = 2^(2n).
- a(n) = Catalan(n)^(2*n-2).A079103
a(n) = Catalan(n)^(2*n-2).
- Number of permutations of length n containing the minimum number of monotone subsequences of length 4.A079104
Number of permutations of length n containing the minimum number of monotone subsequences of length 4.
- Number of permutations of length n, in which all monotone subsequences of length 4 are descending or all such subsequences are ascending, containing the minimum number of such subsequences subject to that constraint.A079105
Number of permutations of length n, in which all monotone subsequences of length 4 are descending or all such subsequences are ascending, containing the minimum number of such subsequences subject to that constraint.
- Number of permutations of length n containing the minimum number of monotone subsequences of length 5.A079106
Number of permutations of length n containing the minimum number of monotone subsequences of length 5.
- Number of digits of A077722(n) written in base 8.A079107
Number of digits of A077722(n) written in base 8.
- Number of 1's in the base 8 form of A077722(n).A079108
Number of 1's in the base 8 form of A077722(n).
- Number of zeros in the base 8 form of A077722(n).A079109
Number of zeros in the base 8 form of A077722(n).
- Number of 2's in n# (n primorial) = 2's in A002110(n).A079110
Number of 2's in n# (n primorial) = 2's in A002110(n).