Sequences
392,541 sequences
- a(n) = (n^2 + n + 1)!.A066061
a(n) = (n^2 + n + 1)!.
- Number of subsets S of T={0,1,2,...,n} such that each element of T is the sum of two (not necessarily distinct) elements of S.A066062
Number of subsets S of T={0,1,2,...,n} such that each element of T is the sum of two (not necessarily distinct) elements of S.
- Size of the smallest subset S of T={0,1,2,...,n} such that each element of T is the sum of two elements of S.A066063
Size of the smallest subset S of T={0,1,2,...,n} such that each element of T is the sum of two elements of S.
- a(n) = p.q in decimal notation where p = prime(n) and q is the smallest prime (A066065(n)) such that the concatenation p.q is a prime.A066064
a(n) = p.q in decimal notation where p = prime(n) and q is the smallest prime (A066065(n)) such that the concatenation p.q is a prime.
- a(n) = smallest prime q such that in decimal notation the concatenation prime(n)q yields a prime ( = A066064(n)).A066065
a(n) = smallest prime q such that in decimal notation the concatenation prime(n)q yields a prime ( = A066064(n)).
- a(n) = prime(2*n) - 2*prime(n).A066066
a(n) = prime(2*n) - 2*prime(n).
- Number of binary strings u of any length with property that length(u) + number of 0's in u <= n (only one of a string and its reversal are counted).A066067
Number of binary strings u of any length with property that length(u) + number of 0's in u <= n (only one of a string and its reversal are counted).
- a(n) = n^n + n.A066068
a(n) = n^n + n.
- a(n) is the smallest positive integer m such that n divides (n + m)^m.A066069
a(n) is the smallest positive integer m such that n divides (n + m)^m.
- a(1) = 1; for m > 0, a(2m) = 2(2m+1), a(2m+1) = 2m+1.A066070
a(1) = 1; for m > 0, a(2m) = 2(2m+1), a(2m+1) = 2m+1.
- Nonprime numbers k such that phi(k) + 1 is prime.A066071
Nonprime numbers k such that phi(k) + 1 is prime.
- Prime numbers arising in A066071.A066072
Prime numbers arising in A066071.
- Composite numbers k such that sigma(k) - 1 is prime.A066073
Composite numbers k such that sigma(k) - 1 is prime.
- Primes arising in A066073.A066074
Primes arising in A066073.
- Number of solutions x to prime(n) = sigma(x) - 1, where prime(n) is the n-th prime.A066075
Number of solutions x to prime(n) = sigma(x) - 1, where prime(n) is the n-th prime.
- Primes p such that there is a unique solution to p = sigma(x) - 1.A066076
Primes p such that there is a unique solution to p = sigma(x) - 1.
- a(n) is the number of x such that sigma(x)-1 is 0 or one of the first n-1 primes.A066077
a(n) is the number of x such that sigma(x)-1 is 0 or one of the first n-1 primes.
- Duplicate of A058339.A066078
Duplicate of A058339.
- Arises in detailed black hole state counting in loop quantum gravity.A066079
Arises in detailed black hole state counting in loop quantum gravity.
- Largest solution x to phi(x) + 1 = prime(n).A066080
Largest solution x to phi(x) + 1 = prime(n).
- a(n) = smallest m such that m+2^j and m-2^j are prime for all 0 < j <= n.A066081
a(n) = smallest m such that m+2^j and m-2^j are prime for all 0 < j <= n.
- Prime octets: numbers k such that 210*k - 105 +- 2^j are prime for all 1 <= j <= 4.A066082
Prime octets: numbers k such that 210*k - 105 +- 2^j are prime for all 1 <= j <= 4.
- Number of supersolvable groups of order n.A066083
Number of supersolvable groups of order n.
- a(n) = (n!)^2 + n! + n.A066084
a(n) = (n!)^2 + n! + n.
- Orders of non-supersolvable groups.A066085
Orders of non-supersolvable groups.
- Greatest common divisor of product (p-1) and product (p+1), where p ranges over distinct prime divisors of n; a(n) = gcd(A048250(n), A173557(n)).A066086
Greatest common divisor of product (p-1) and product (p+1), where p ranges over distinct prime divisors of n; a(n) = gcd(A048250(n), A173557(n)).
- a(n) = gcd(sigma(n), phi(n)) - gcd(sigma(rad(n)), phi(rad(n))); rad = A007947.A066087
a(n) = gcd(sigma(n), phi(n)) - gcd(sigma(rad(n)), phi(rad(n))); rad = A007947.
- Number of distinct prime factors of sigma_2(n), where sigma_2(n) = A001157(n).A066088
Number of distinct prime factors of sigma_2(n), where sigma_2(n) = A001157(n).
- Smallest m such that A066088(m) = A001221(A001157(m)) = n.A066089
Smallest m such that A066088(m) = A001221(A001157(m)) = n.
- a(n) = binomial(sigma(n), n).A066090
a(n) = binomial(sigma(n), n).
- a(n+2) = a(n+1)*a(n)*(a(n+1)+a(n)).A066091
a(n+2) = a(n+1)*a(n)*(a(n+1)+a(n)).
- Erroneous version of A063427.A066092
Erroneous version of A063427.
- Duplicate of A022342.A066093
Duplicate of A022342.
- Type D Eulerian triangle.A066094
Type D Eulerian triangle.
- Duplicate of A003622.A066095
Duplicate of A003622.
- a(n) = floor(n*phi), where phi = (1 + sqrt(5))/2.A066096
a(n) = floor(n*phi), where phi = (1 + sqrt(5))/2.
- Duplicate of A035336.A066097
Duplicate of A035336.
- Sum of digits of primorial(n).A066098
Sum of digits of primorial(n).
- Triangle read by rows, in which row n lists the compositions of n in reverse lexicographic order.A066099
Triangle read by rows, in which row n lists the compositions of n in reverse lexicographic order.
- Primes p such that p^6 + p^3 + 1 is prime.A066100
Primes p such that p^6 + p^3 + 1 is prime.
- Duplicate of A063784.A066101
Duplicate of A063784.
- Number of distinct prime factors of sigma_4(n), the sum of the 4th powers of divisors of n.A066102
Number of distinct prime factors of sigma_4(n), the sum of the 4th powers of divisors of n.
- Smallest m such that A001221(A001159(m)) = n.A066103
Smallest m such that A001221(A001159(m)) = n.
- a(2n) = 2n, a(2n+1) = 4(n+1).A066104
a(2n) = 2n, a(2n+1) = 4(n+1).
- Indices of the maximum increasing subsequences of A066848 and A066849.A066105
Indices of the maximum increasing subsequences of A066848 and A066849.
- a(2n) = (2n)(2n+2); a(2n+1) = 4n + 4.A066106
a(2n) = (2n)(2n+2); a(2n+1) = 4n + 4.
- a(0) = 0; for n > 0, a(2n+1) = (2n+1)*(2n+3); a(2n) = 2n + 2.A066107
a(0) = 0; for n > 0, a(2n+1) = (2n+1)*(2n+3); a(2n) = 2n + 2.
- Sum n^d over all divisors of n.A066108
Sum n^d over all divisors of n.
- Numbers k such that sigma_4(k)/sigma_2(k) is prime.A066109
Numbers k such that sigma_4(k)/sigma_2(k) is prime.
- Primes of the form sigma_4(k)/sigma_2(k), arising in A066109.A066110
Primes of the form sigma_4(k)/sigma_2(k), arising in A066109.