Sequences
392,541 sequences
- Numbers k such that the concatenation of odd numbers from 1 to k is a prime.A066811
Numbers k such that the concatenation of odd numbers from 1 to k is a prime.
- Numbers k such that phi(k+1) = phi(k-1).A066812
Numbers k such that phi(k+1) = phi(k-1).
- a(n) = lcm(phi(n), phi(n+1)).A066813
a(n) = lcm(phi(n), phi(n+1)).
- Smallest prime p such that (p-1) has n divisors, or 0 if no such prime exists.A066814
Smallest prime p such that (p-1) has n divisors, or 0 if no such prime exists.
- Number of partitions of n into sums of products.A066815
Number of partitions of n into sums of products.
- Expansion of Product_{k>=1} (1 + A001055(k)*x^k).A066816
Expansion of Product_{k>=1} (1 + A001055(k)*x^k).
- Conjectured values of first prime in the orbit f(m), f(f(m)), ..., where f(n) = A067599(n) and m = n-th composite number; or 0 if none exists.A066817
Conjectured values of first prime in the orbit f(m), f(f(m)), ..., where f(n) = A067599(n) and m = n-th composite number; or 0 if none exists.
- a(n) is the least k such that n + Sum_{i=1..k} A005384(i) is prime; or 0 if none exists.A066818
a(n) is the least k such that n + Sum_{i=1..k} A005384(i) is prime; or 0 if none exists.
- Sum of the first n Sophie Germain primes.A066819
Sum of the first n Sophie Germain primes.
- Integers of the form phi(n^2+1)/n.A066820
Integers of the form phi(n^2+1)/n.
- Numbers k such that phi(k^2-1)/(k-1) is an integer.A066821
Numbers k such that phi(k^2-1)/(k-1) is an integer.
- The fourth column of A038622, triangular array that counts rooted polyominoes.A066822
The fourth column of A038622, triangular array that counts rooted polyominoes.
- Primes in the main diagonal of the Stolarsky array (cf. A035506).A066823
Primes in the main diagonal of the Stolarsky array (cf. A035506).
- Sum of the reciprocals of the partitions of n enumerated in A058360.A066824
Sum of the reciprocals of the partitions of n enumerated in A058360.
- a(1) = 1; set of digits of a(n)^2 is a subset of the set of digits of a(n+1)^2.A066825
a(1) = 1; set of digits of a(n)^2 is a subset of the set of digits of a(n+1)^2.
- Numbers k that divide the average of prime(k-1) and prime(k).A066826
Numbers k that divide the average of prime(k-1) and prime(k).
- a(n) = gcd(2^((n*(n+1)/2)) + 1, 2^n + 1).A066827
a(n) = gcd(2^((n*(n+1)/2)) + 1, 2^n + 1).
- Numbers k that divide the average of prime(k-1) and prime(k+1).A066828
Numbers k that divide the average of prime(k-1) and prime(k+1).
- Parity of Omega(n): a(n) = 1 if n is the product of an odd number of primes; 0 if product of even number of primes.A066829
Parity of Omega(n): a(n) = 1 if n is the product of an odd number of primes; 0 if product of even number of primes.
- a(n) = lcm(n+1, n-1).A066830
a(n) = lcm(n+1, n-1).
- Numbers k such that sigma(k) divides sigma(phi(k)).A066831
Numbers k such that sigma(k) divides sigma(phi(k)).
- Number of kanji strokes for 10^(4*n).A066832
Number of kanji strokes for 10^(4*n).
- Continued fraction expansion of Product_{p prime} (1 - 1/(p^4 - p^3)).A066833
Continued fraction expansion of Product_{p prime} (1 - 1/(p^4 - p^3)).
- Continued fraction expansion of Product_{p prime} (1 - 1/(p^5 - p^4)).A066834
Continued fraction expansion of Product_{p prime} (1 - 1/(p^5 - p^4)).
- a(n) = omega((prime(n)-1)! + 1), where omega is given by A001221, primes in A000040.A066835
a(n) = omega((prime(n)-1)! + 1), where omega is given by A001221, primes in A000040.
- Least number k such that k divides the average of prime(k-n) and prime(k+n).A066836
Least number k such that k divides the average of prime(k-n) and prime(k+n).
- Least number k such that for the average of n consecutive primes, beginning with the k-th prime, is divisible by the average of their indices.A066837
Least number k such that for the average of n consecutive primes, beginning with the k-th prime, is divisible by the average of their indices.
- Product of primes < n that do not divide n.A066838
Product of primes < n that do not divide n.
- a(n) = sum of positive divisors k of n with k <= sqrt(n).A066839
a(n) = sum of positive divisors k of n with k <= sqrt(n).
- Sum of positive integers k where k <= n/2 and gcd(k,n) = 1.A066840
Sum of positive integers k where k <= n/2 and gcd(k,n) = 1.
- a(n) = Product{k|n} k^(n/k); product is over the positive divisors of n.A066841
a(n) = Product{k|n} k^(n/k); product is over the positive divisors of n.
- a(n) = Product_{k|n} k^k; product is over the positive divisors, k, of n.A066842
a(n) = Product_{k|n} k^k; product is over the positive divisors, k, of n.
- a(n) = Product_{k=1..n} d(k); d(k) = A000005(k) is the number of positive divisors of k.A066843
a(n) = Product_{k=1..n} d(k); d(k) = A000005(k) is the number of positive divisors of k.
- Film speeds.A066844
Film speeds.
- a(n) = (lcm_{k=0..n} (2^k + 1))/(lcm_{k=0..n-1} (2^k + 1)).A066845
a(n) = (lcm_{k=0..n} (2^k + 1))/(lcm_{k=0..n-1} (2^k + 1)).
- Numbers of the form a^a + b^b, a >= b > 0.A066846
Numbers of the form a^a + b^b, a >= b > 0.
- Integers of the form m! + n!, m and n = positive integers.A066847
Integers of the form m! + n!, m and n = positive integers.
- Consider sequence of fractions A066657/A066658 produced by ratios of terms in A066720; let m = smallest integer such that all fractions 1/n, 2/n, ..., (n-1)/n have appeared when we reach A066720(m) = k; sequence gives values of k; set a(n) = -1 if some fraction i/n never appears.A066848
Consider sequence of fractions A066657/A066658 produced by ratios of terms in A066720; let m = smallest integer such that all fractions 1/n, 2/n, ..., (n-1)/n have appeared when we reach A066720(m) = k; sequence gives values of k; set a(n) = -1 if some fraction i/n never appears.
- Consider sequence of fractions A066657/A066658 produced by ratios of terms in A066720; let m = smallest integer such that all fractions 1/n, 2/n, ..., (n-1)/n have appeared when we reach A066720(m) = k; sequence gives values of m; set a(n) = -1 if some fraction i/n never appears.A066849
Consider sequence of fractions A066657/A066658 produced by ratios of terms in A066720; let m = smallest integer such that all fractions 1/n, 2/n, ..., (n-1)/n have appeared when we reach A066720(m) = k; sequence gives values of m; set a(n) = -1 if some fraction i/n never appears.
- Numbers n such that phi(phi(n)) + sigma(sigma(n)) = phi(sigma(n)) + sigma(phi(n)), where phi=A000010 is Euler's totient function and sigma=A000203 is the sum of divisors function.A066850
Numbers n such that phi(phi(n)) + sigma(sigma(n)) = phi(sigma(n)) + sigma(phi(n)), where phi=A000010 is Euler's totient function and sigma=A000203 is the sum of divisors function.
- Number of ordered solutions (x,y,z) to xy + yz + zx = n with x,y,z >= 1.A066851
Number of ordered solutions (x,y,z) to xy + yz + zx = n with x,y,z >= 1.
- Odd values arising in A066820.A066852
Odd values arising in A066820.
- Number of different remainders (or residues) for the Fibonacci numbers (A000045) when divided by n (i.e., the size of the set of F(i) mod n over all i).A066853
Number of different remainders (or residues) for the Fibonacci numbers (A000045) when divided by n (i.e., the size of the set of F(i) mod n over all i).
- a(n) = Sum_{k=1..8} 2^(8-k) * c(16n+2k+1), where c(j) is 1 if j is composite, 0 if j is prime.A066854
a(n) = Sum_{k=1..8} 2^(8-k) * c(16n+2k+1), where c(j) is 1 if j is composite, 0 if j is prime.
- Triangle T(n,k) of numbers of representations of n as a sum of k products of positive integers, k=1..n. 1 is not allowed as a factor, unless it is the only factor.Representations which differ only in the order of terms or factors are considered equivalent.A066855
Triangle T(n,k) of numbers of representations of n as a sum of k products of positive integers, k=1..n. 1 is not allowed as a factor, unless it is the only factor.Representations which differ only in the order of terms or factors are considered equivalent.
- a(n) = omega(n!+1), where omega is the number of distinct primes dividing n, A001221.A066856
a(n) = omega(n!+1), where omega is the number of distinct primes dividing n, A001221.
- Smallest number k such that n! - k is a square.A066857
Smallest number k such that n! - k is a square.
- Smallest k>1 such that for each integer x, x^k=x or x^k=0 (mod n); or 0 if no such k exists.A066858
Smallest k>1 such that for each integer x, x^k=x or x^k=0 (mod n); or 0 if no such k exists.
- Product of sums of divisors and non-divisors.A066859
Product of sums of divisors and non-divisors.
- The sum of the non-divisors of n (less than n) is a multiple of the sum of the divisors of n.A066860
The sum of the non-divisors of n (less than n) is a multiple of the sum of the divisors of n.