Sequences
392,541 sequences
- Numbers n such that phi(n)^2 + sigma(n)^2 is an integer square.A067811
Numbers n such that phi(n)^2 + sigma(n)^2 is an integer square.
- Nonprime n such that 2n+1 is prime.A067812
Nonprime n such that 2n+1 is prime.
- Start of a record-breaking run of consecutive integers with a number of prime factors (counted with multiplicity) equal to 3.A067813
Start of a record-breaking run of consecutive integers with a number of prime factors (counted with multiplicity) equal to 3.
- The start of a record-breaking run of consecutive integers with a number of prime factors (counted with multiplicity) equal to 4.A067814
The start of a record-breaking run of consecutive integers with a number of prime factors (counted with multiplicity) equal to 4.
- a(n) = gcd(n, floor(sqrt(n))).A067815
a(n) = gcd(n, floor(sqrt(n))).
- Numbers k such that sigma(k+1) - sigma(k) = k + 1.A067816
Numbers k such that sigma(k+1) - sigma(k) = k + 1.
- a(n) = Sum_{r|n, s|n, t|n, r<s<t} r*s*t.A067817
a(n) = Sum_{r|n, s|n, t|n, r<s<t} r*s*t.
- Start with 1. To get a(n+1), describe a(n) in terms of the number of 0's, 1's, 2's,...,9's it has. Do not ignore leading 0's in the computation, but ignore them when listing the terms.A067818
Start with 1. To get a(n+1), describe a(n) in terms of the number of 0's, 1's, 2's,...,9's it has. Do not ignore leading 0's in the computation, but ignore them when listing the terms.
- Sum of the divisors of binomial(2n,n).A067819
Sum of the divisors of binomial(2n,n).
- The start of a record-breaking run of consecutive integers with a number of prime factors (counted with multiplicity) equal to 5.A067820
The start of a record-breaking run of consecutive integers with a number of prime factors (counted with multiplicity) equal to 5.
- The start of a record-breaking run of consecutive integers with a number of prime factors (counted with multiplicity) equal to 6.A067821
The start of a record-breaking run of consecutive integers with a number of prime factors (counted with multiplicity) equal to 6.
- The start of a record-breaking run of consecutive integers with a number of prime factors equal to 7.A067822
The start of a record-breaking run of consecutive integers with a number of prime factors equal to 7.
- Start with 2 and concatenate ("absorb") the next prime; continually repeat this procedure.A067823
Start with 2 and concatenate ("absorb") the next prime; continually repeat this procedure.
- a(1) = 1; for n > 1, a(n) = 1 + Sum_{0 < d < n, d|n} a(d).A067824
a(1) = 1; for n > 1, a(n) = 1 + Sum_{0 < d < n, d|n} a(d).
- Even values of k such that sigma(k + 1) > sigma(k).A067825
Even values of k such that sigma(k + 1) > sigma(k).
- Primes p such that sigma(2*p+1) > 3*(p+1).A067826
Primes p such that sigma(2*p+1) > 3*(p+1).
- Even numbers k such that k/2 is nonprime and sigma(k+1) > sigma(k).A067827
Even numbers k such that k/2 is nonprime and sigma(k+1) > sigma(k).
- Odd numbers k such that sigma(k+1) < sigma(k).A067828
Odd numbers k such that sigma(k+1) < sigma(k).
- Primes p such that sigma(p-2) < p.A067829
Primes p such that sigma(p-2) < p.
- Primes p such that sigma(p-4) < p.A067830
Primes p such that sigma(p-4) < p.
- Primes p such that sigma(p-6) < p.A067831
Primes p such that sigma(p-6) < p.
- Primes p such that sigma(p-6) > p.A067832
Primes p such that sigma(p-6) > p.
- Primes p such that sigma(p-4) > p.A067833
Primes p such that sigma(p-4) > p.
- Numbers k such that in the ring Z[sqrt(3)] the norm of (-1+sqrt(3))^k-1 is prime.A067834
Numbers k such that in the ring Z[sqrt(3)] the norm of (-1+sqrt(3))^k-1 is prime.
- Average order of an element in the symmetric group S_n rounded down.A067835
Average order of an element in the symmetric group S_n rounded down.
- Let a(1)=2, f(n)=a(1)*a(2)*...*a(n-1) for n>=1 and a(n)=nextprime(f(n)+1)-f(n) for n>=2, where nextprime(x) is the smallest prime > x.A067836
Let a(1)=2, f(n)=a(1)*a(2)*...*a(n-1) for n>=1 and a(n)=nextprime(f(n)+1)-f(n) for n>=2, where nextprime(x) is the smallest prime > x.
- a(1)=2; to form a(n+1), append P, the largest prime < a(n), if any and Q, the smallest prime > a(n), at the beginning and the end of a(n), respectively.A067837
a(1)=2; to form a(n+1), append P, the largest prime < a(n), if any and Q, the smallest prime > a(n), at the beginning and the end of a(n), respectively.
- Numbers n such that n and prime(n) end with the same two digits.A067838
Numbers n such that n and prime(n) end with the same two digits.
- Duplicate of A047211.A067839
Duplicate of A047211.
- Factorial expansion of e^2 : exp(2) = Sum_{n >= 0} a(n)/n!.A067840
Factorial expansion of e^2 : exp(2) = Sum_{n >= 0} a(n)/n!.
- Numbers n such that n and prime(n) end with the same three digits.A067841
Numbers n such that n and prime(n) end with the same three digits.
- Expansion of 1/Product_{k=1..infinity} (1-x^A007097(k)).A067842
Expansion of 1/Product_{k=1..infinity} (1-x^A007097(k)).
- Least solution k>n of phi(k-n)+phi(k+n)=phi(2k).A067843
Least solution k>n of phi(k-n)+phi(k+n)=phi(2k).
- Numbers k such that k and 2^k end with the same digit.A067844
Numbers k such that k and 2^k end with the same digit.
- Largest n-digit pseudoprime (to base 2).A067845
Largest n-digit pseudoprime (to base 2).
- Least m such that A067513(m) = n.A067846
Least m such that A067513(m) = n.
- Number of divisors d of n! such that d+1 is prime.A067847
Number of divisors d of n! such that d+1 is prime.
- prime(n)+1 divides prime(n^2)+1.A067848
prime(n)+1 divides prime(n^2)+1.
- a(n) = max{k: f(n),...,f^k(n) are prime}, where f(m) = 2m+1 and f^k denotes composition of f with itself k times.A067849
a(n) = max{k: f(n),...,f^k(n) are prime}, where f(m) = 2m+1 and f^k denotes composition of f with itself k times.
- Highest power of 2 not exceeding n!.A067850
Highest power of 2 not exceeding n!.
- Numbers k such that prime(k) divides prime(k^2)-1.A067851
Numbers k such that prime(k) divides prime(k^2)-1.
- Numbers k that divide prime(k^2) - 1.A067852
Numbers k that divide prime(k^2) - 1.
- Numbers k such that k divides prime(k^2)+1.A067853
Numbers k such that k divides prime(k^2)+1.
- a(n) = cardinality of the (ordered) list L_n defined inductively by: L_1 = {2}; if, reading from left to right, there is a member p of L_n such that prime(n+1) can be appended to the beginning or end of p so that their neighboring digits are equal, then append prime(n+1) to the beginning or end of p to obtain L_(n+1); otherwise, add prime(n+1) to the end of the list L_n to obtain L_(n+1).A067854
a(n) = cardinality of the (ordered) list L_n defined inductively by: L_1 = {2}; if, reading from left to right, there is a member p of L_n such that prime(n+1) can be appended to the beginning or end of p so that their neighboring digits are equal, then append prime(n+1) to the beginning or end of p to obtain L_(n+1); otherwise, add prime(n+1) to the end of the list L_n to obtain L_(n+1).
- Square of the Euclidean length of the vector of Littlewood-Richardson coefficients of Sum_{lambda |- n} s_lambda^2, where s_lambda are the symmetric Schur functions and the sum runs over all partitions lambda of n.A067855
Square of the Euclidean length of the vector of Littlewood-Richardson coefficients of Sum_{lambda |- n} s_lambda^2, where s_lambda are the symmetric Schur functions and the sum runs over all partitions lambda of n.
- Sum_{n >= 1} a(n)/n^s = 1/(Sum_{n >= 1} (-1)^(n + 1)/n^s).A067856
Sum_{n >= 1} a(n)/n^s = 1/(Sum_{n >= 1} (-1)^(n + 1)/n^s).
- Sum_{k|n} a(k)/k! = Sum_{j=1 to n} 1/j, sum on left is over positive divisors k of n.A067857
Sum_{k|n} a(k)/k! = Sum_{j=1 to n} 1/j, sum on left is over positive divisors k of n.
- J_n(n), where J is the Jordan function, J_n(n) = n^n product{p|n}(1 - 1/p^n), the product is over the distinct primes, p, dividing n.A067858
J_n(n), where J is the Jordan function, J_n(n) = n^n product{p|n}(1 - 1/p^n), the product is over the distinct primes, p, dividing n.
- a(1) = 1; a(n+1) = floor(sqrt(Sum_{k=1..n} a(k)^2)).A067859
a(1) = 1; a(n+1) = floor(sqrt(Sum_{k=1..n} a(k)^2)).
- Primes which are the concatenation of numbers n_1, n_2, n_3, in that order, with n_1 + n_2 = n_3 (leading zeros are forbidden for nonzero n_i).A067860
Primes which are the concatenation of numbers n_1, n_2, n_3, in that order, with n_1 + n_2 = n_3 (leading zeros are forbidden for nonzero n_i).