Sequences
392,541 sequences
- a(n) = Sum_{k=1..n} omega(k)^2.A069811
a(n) = Sum_{k=1..n} omega(k)^2.
- a(n) = Sum_{k=1..n} (bigomega(k)-omega(k)).A069812
a(n) = Sum_{k=1..n} (bigomega(k)-omega(k)).
- Maximum number of triangles in polyiamond with perimeter n.A069813
Maximum number of triangles in polyiamond with perimeter n.
- Decimal expansion of root of the equation x*cosh(x)=1.A069814
Decimal expansion of root of the equation x*cosh(x)=1.
- Decimal expansion of (negative of) real solution -1<x<1 to zeta(x)=sin(x).A069815
Decimal expansion of (negative of) real solution -1<x<1 to zeta(x)=sin(x).
- a(n) = (sum of digits of n)^2 - (sum of digits^2 of n).A069816
a(n) = (sum of digits of n)^2 - (sum of digits^2 of n).
- Smallest remainder of p+q modulo n, where p*q = n^2 - 1, 1 < p < n-1, or n if no such factorization exists.A069817
Smallest remainder of p+q modulo n, where p*q = n^2 - 1, 1 < p < n-1, or n if no such factorization exists.
- Let x = 1.757739951145463... be smallest real number that satisfies gcd(floor(x^m),m)=1 for all integers m>0; sequence gives floor(x^n).A069818
Let x = 1.757739951145463... be smallest real number that satisfies gcd(floor(x^m),m)=1 for all integers m>0; sequence gives floor(x^n).
- Numbers k such that 1/(Sum_{p|k} (1/p) - 1), where p are the prime divisors of k, is a positive integer.A069819
Numbers k such that 1/(Sum_{p|k} (1/p) - 1), where p are the prime divisors of k, is a positive integer.
- (a(n)^2-1)/(n^2-1) is the smallest integer>1.A069820
(a(n)^2-1)/(n^2-1) is the smallest integer>1.
- a(n) is the smallest k > n such that (k^3 - 1)/(n^3 - 1) is an integer.A069821
a(n) is the smallest k > n such that (k^3 - 1)/(n^3 - 1) is an integer.
- Numbers k for which there is at least one x < k such that sigma(x) = sigma(k).A069822
Numbers k for which there is at least one x < k such that sigma(x) = sigma(k).
- Nonprime numbers k for which there is no x < k such that phi(x) = phi(k).A069823
Nonprime numbers k for which there is no x < k such that phi(x) = phi(k).
- Numbers n such that there is at least one x<n such that phi(x)sigma(x)=phi(n)sigma(n).A069824
Numbers n such that there is at least one x<n such that phi(x)sigma(x)=phi(n)sigma(n).
- Numbers k such that there is no x < k such that sigma(x) = phi(k).A069825
Numbers k such that there is no x < k such that sigma(x) = phi(k).
- Numbers k such that sigma(k^2-k-1) = k*(k+1).A069826
Numbers k such that sigma(k^2-k-1) = k*(k+1).
- Numbers k such that sigma(core(k)) = tau(k) where core(k) is the squarefree part of k, tau(k) is the number of divisors of k, and sigma(k) is their sum.A069827
Numbers k such that sigma(core(k)) = tau(k) where core(k) is the squarefree part of k, tau(k) is the number of divisors of k, and sigma(k) is their sum.
- Sum of positive integers k for k <= n and gcd(k,n) = gcd(k+1,n).A069828
Sum of positive integers k for k <= n and gcd(k,n) = gcd(k+1,n).
- a(n) = PS(n)(2n), where PS is described in A057032.A069829
a(n) = PS(n)(2n), where PS is described in A057032.
- Multiplicative inverse of prime(n) modulo prime(n+1).A069830
Multiplicative inverse of prime(n) modulo prime(n+1).
- Number of graphical partitions of simple Eulerian graphs (partitions given by the degrees of vertices of simple (no loops or multiple edges) graphs having only vertices of even degrees) having n edges.A069831
Number of graphical partitions of simple Eulerian graphs (partitions given by the degrees of vertices of simple (no loops or multiple edges) graphs having only vertices of even degrees) having n edges.
- Prefixing, suffixing or inserting a 7 in the number anywhere gives a prime.A069832
Prefixing, suffixing or inserting a 7 in the number anywhere gives a prime.
- Prefixing, suffixing or inserting a 9 in the number anywhere gives a prime.A069833
Prefixing, suffixing or inserting a 9 in the number anywhere gives a prime.
- a(n) = n-th reduced triangular number: n*(n+1)/{2^k} where 2^k is the largest power of 2 that divides product n*(n+1).A069834
a(n) = n-th reduced triangular number: n*(n+1)/{2^k} where 2^k is the largest power of 2 that divides product n*(n+1).
- Define an array as follows: b(i,0)=b(0,j)=1, b(i,j) = 2*b(i-1,j-1) + b(i-1,j) + b(i,j-1). Then a(n) = b(n,n).A069835
Define an array as follows: b(i,0)=b(0,j)=1, b(i,j) = 2*b(i-1,j-1) + b(i-1,j) + b(i,j-1). Then a(n) = b(n,n).
- Inverse permutation to A057033: a(n) is the m such that A057033(m) = n, or 0 if no such m exists.A069836
Inverse permutation to A057033: a(n) is the m such that A057033(m) = n, or 0 if no such m exists.
- Smallest prime which is a concatenation of n primes.A069837
Smallest prime which is a concatenation of n primes.
- Let M_k be the k X k matrix, M_(i,j) = 1 if i^2 + j^2 is squarefree, M_(i,j) = 0 otherwise; sequence gives values of k such that det(M_k) = 0.A069838
Let M_k be the k X k matrix, M_(i,j) = 1 if i^2 + j^2 is squarefree, M_(i,j) = 0 otherwise; sequence gives values of k such that det(M_k) = 0.
- Number of different (unlabeled) 2-cell embeddings of the complete graph K_n on n vertices into orientable surfaces.A069839
Number of different (unlabeled) 2-cell embeddings of the complete graph K_n on n vertices into orientable surfaces.
- Number of different (unlabeled) 2-cell embeddings of the n-wheel graph W_(n+1) on n+1 nodes into orientable surfaces.A069840
Number of different (unlabeled) 2-cell embeddings of the n-wheel graph W_(n+1) on n+1 nodes into orientable surfaces.
- A036937(n) - 222...2 (with n 2s) interpreted as binary numbers and converted to decimal.A069841
A036937(n) - 222...2 (with n 2s) interpreted as binary numbers and converted to decimal.
- Number of distinct primes obtained by inserting a 1 at all possible places in n. This includes prefixing and suffixing.A069842
Number of distinct primes obtained by inserting a 1 at all possible places in n. This includes prefixing and suffixing.
- Number of distinct primes obtained by inserting a 2 at all possible places in n. This includes prefixing.A069843
Number of distinct primes obtained by inserting a 2 at all possible places in n. This includes prefixing.
- Number of distinct primes obtained by inserting a 3 at all possible places in n. This includes prefixing and suffixing.A069844
Number of distinct primes obtained by inserting a 3 at all possible places in n. This includes prefixing and suffixing.
- Number of distinct primes obtained by inserting a 4 at all possible places in n. This includes prefixing.A069845
Number of distinct primes obtained by inserting a 4 at all possible places in n. This includes prefixing.
- Number of distinct primes obtained by inserting a 5 at all possible places in n. This includes prefixing.A069846
Number of distinct primes obtained by inserting a 5 at all possible places in n. This includes prefixing.
- Number of distinct primes obtained by inserting a 6 at all possible places in n. This includes prefixing.A069847
Number of distinct primes obtained by inserting a 6 at all possible places in n. This includes prefixing.
- Number of distinct primes obtained by inserting a 7 at all possible places in n. This includes prefixing as well as suffixing.A069848
Number of distinct primes obtained by inserting a 7 at all possible places in n. This includes prefixing as well as suffixing.
- Number of distinct primes obtained by inserting an 8 at all possible places in n. This includes prefixing.A069849
Number of distinct primes obtained by inserting an 8 at all possible places in n. This includes prefixing.
- Number of distinct primes obtained by inserting a 9 at all possible places in n. This includes prefixing as well as suffixing.A069850
Number of distinct primes obtained by inserting a 9 at all possible places in n. This includes prefixing as well as suffixing.
- Number of distinct primes obtained by inserting a 0 at all possible places in n. This includes prefixing.A069851
Number of distinct primes obtained by inserting a 0 at all possible places in n. This includes prefixing.
- a(n) = Sum_{i=0..2n} B(i)*C(2n+1,i)*5^i where B(i) are the Bernoulli numbers, C(2n,i) the binomial numbers.A069852
a(n) = Sum_{i=0..2n} B(i)*C(2n+1,i)*5^i where B(i) are the Bernoulli numbers, C(2n,i) the binomial numbers.
- Numerators of coefficients of expansion of sinh(x)/sin(x) (even powers only).A069853
Numerators of coefficients of expansion of sinh(x)/sin(x) (even powers only).
- Denominators of coefficients of expansion of sinh(x)/sin(x) (even powers only).A069854
Denominators of coefficients of expansion of sinh(x)/sin(x) (even powers only).
- Decimal expansion of the root of x*tan(x)=1.A069855
Decimal expansion of the root of x*tan(x)=1.
- E.g.f.: exp(x)/(1+LambertW(x)).A069856
E.g.f.: exp(x)/(1+LambertW(x)).
- Decimal expansion of -C, where C = -0.2959050055752... is the real solution < 0 to zeta(x) = x.A069857
Decimal expansion of -C, where C = -0.2959050055752... is the real solution < 0 to zeta(x) = x.
- 1/n has period 4 in base 10.A069858
1/n has period 4 in base 10.
- (Largest prime factor of n) modulo (smallest prime factor of n).A069859
(Largest prime factor of n) modulo (smallest prime factor of n).
- Numbers m that divide the concatenation of m+1 and m+2.A069860
Numbers m that divide the concatenation of m+1 and m+2.