Sequences
392,541 sequences
- Expansion of Product_{i in A069909} 1/(1 - x^i).A069911
Expansion of Product_{i in A069909} 1/(1 - x^i).
- a(n) = A067552(n)/9 where A067552(n) = SumOfDigits(n)^2 - SumOfDigits(n^2), with SumOfDigits = A007953.A069912
a(n) = A067552(n)/9 where A067552(n) = SumOfDigits(n)^2 - SumOfDigits(n^2), with SumOfDigits = A007953.
- a(n) = Sum_{d|n} (d-1)*tau(n/d).A069913
a(n) = Sum_{d|n} (d-1)*tau(n/d).
- a(n) = Sum_{d|n} (d-1)*sigma(n/d).A069914
a(n) = Sum_{d|n} (d-1)*sigma(n/d).
- Sum of (1+phi)-divisors of n (cf. A061389).A069915
Sum of (1+phi)-divisors of n (cf. A061389).
- Number of log-concave compositions (ordered partitions) of n.A069916
Number of log-concave compositions (ordered partitions) of n.
- In base 6, the reversal of n equals the sum of the reversals of the proper divisors of n.A069917
In base 6, the reversal of n equals the sum of the reversals of the proper divisors of n.
- Number of ways of partitioning the set {1...n} into two subsets whose sums are as nearly equal as possible.A069918
Number of ways of partitioning the set {1...n} into two subsets whose sums are as nearly equal as possible.
- Squares which repeat with at least two full periods when written in base 10.A069919
Squares which repeat with at least two full periods when written in base 10.
- Number of noninvertible n X n matrices mod 6 (i.e., over the ring Z_6).A069920
Number of noninvertible n X n matrices mod 6 (i.e., over the ring Z_6).
- Define C(n) by the recursion C(0) = 1 + I where I^2 = -1, C(n+1) = 1/(1+C(n)); then a(n) = (-1)^n/Im(C(n)) where Im(z) is the imaginary part of the complex number z.A069921
Define C(n) by the recursion C(0) = 1 + I where I^2 = -1, C(n+1) = 1/(1+C(n)); then a(n) = (-1)^n/Im(C(n)) where Im(z) is the imaginary part of the complex number z.
- Number of primes p such that n^n <= p <= n^n + n^2.A069922
Number of primes p such that n^n <= p <= n^n + n^2.
- Number of primes p such that 2^n <= p <= 2^n + prime(n).A069923
Number of primes p such that 2^n <= p <= 2^n + prime(n).
- Number of k, 1<=k<=n, such that phi(k) divides k.A069924
Number of k, 1<=k<=n, such that phi(k) divides k.
- a(n) = phi(2^n+1)/(2*n).A069925
a(n) = phi(2^n+1)/(2*n).
- Number of k, 1<=k<=n, such that k divides sigma(k).A069926
Number of k, 1<=k<=n, such that k divides sigma(k).
- Numbers k that divide 2^(k+3) - 1.A069927
Numbers k that divide 2^(k+3) - 1.
- Number of integers k, 1<=k<=n, such that tau(k) divides sigma(k) where tau(k) is the number of divisors of k and sigma(k) the sum of divisors of k.A069928
Number of integers k, 1<=k<=n, such that tau(k) divides sigma(k) where tau(k) is the number of divisors of k and sigma(k) the sum of divisors of k.
- Number of k, 1 <= k <= n, such that k^3+1 divides n^3+1.A069929
Number of k, 1 <= k <= n, such that k^3+1 divides n^3+1.
- Number of integers of the form (n+k)/(n-k) with 1 <= k <= n-1.A069930
Number of integers of the form (n+k)/(n-k) with 1 <= k <= n-1.
- Number of k, 1<=k<=n, such that k divides sigma(n).A069931
Number of k, 1<=k<=n, such that k divides sigma(n).
- Number of k, 1<=k<=n, such that phi(k) divides n.A069932
Number of k, 1<=k<=n, such that phi(k) divides n.
- Number of k, 1<=k<=n, such that core(k) divides n, where core(x) is the squarefree part of x, the smallest integer such that x*core(x) is a square.A069933
Number of k, 1<=k<=n, such that core(k) divides n, where core(x) is the squarefree part of x, the smallest integer such that x*core(x) is a square.
- a(n) = lcm_{d|n} sigma(d).A069934
a(n) = lcm_{d|n} sigma(d).
- Maximal power of 2 that divides the n-th partition number.A069935
Maximal power of 2 that divides the n-th partition number.
- Duplicate of A043294.A069936
Duplicate of A043294.
- Duplicate of A043295.A069937
Duplicate of A043295.
- Duplicate of A043296.A069938
Duplicate of A043296.
- 1/3!*((Sum of digits of n)^3 + 3*(Sum of digits of n)*(Sum of digits^2 of n) + 2*(Sum of digits^3 of n)).A069939
1/3!*((Sum of digits of n)^3 + 3*(Sum of digits of n)*(Sum of digits^2 of n) + 2*(Sum of digits^3 of n)).
- (1/2)*((Sum of digits of n)^2 + (Sum of digits^2 of n)).A069940
(1/2)*((Sum of digits of n)^2 + (Sum of digits^2 of n)).
- Number of primes p such that n! <= p <= n! + n^2.A069941
Number of primes p such that n! <= p <= n! + n^2.
- Reversal of n equals the sum of the reversals of the proper divisors of n.A069942
Reversal of n equals the sum of the reversals of the proper divisors of n.
- a(n) = numerator(b(n)), where b(1) = b(2) = 1, b(n) = (b(n-1) + b(n-2))/(n-1).A069943
a(n) = numerator(b(n)), where b(1) = b(2) = 1, b(n) = (b(n-1) + b(n-2))/(n-1).
- a(n) = denominator(b(n)), where b(1) = b(2) = 1, b(n) = (b(n-1) + b(n-2))/(n-1).A069944
a(n) = denominator(b(n)), where b(1) = b(2) = 1, b(n) = (b(n-1) + b(n-2))/(n-1).
- Let M_k be the k X k matrix M_k(i,j)=1/binomial(i+n,j); then a(n)=1/det(M_(n+1)).A069945
Let M_k be the k X k matrix M_k(i,j)=1/binomial(i+n,j); then a(n)=1/det(M_(n+1)).
- Numbers k such that phi(k) mod core(k) = 1 where core(k) is the squarefree part of k.A069946
Numbers k such that phi(k) mod core(k) = 1 where core(k) is the squarefree part of k.
- Denominator of Sum_{k=1..n} k/phi(k).A069947
Denominator of Sum_{k=1..n} k/phi(k).
- a(n) = 1/exp(1) * Sum_{k>=0} (k+n)!^2 / k!^3.A069948
a(n) = 1/exp(1) * Sum_{k>=0} (k+n)!^2 / k!^3.
- a(n) = Sum_{d|n} phi(d+1).A069949
a(n) = Sum_{d|n} phi(d+1).
- Expansion of (1+x^2)*(1+x^5)*(1+x^8)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)*(1-x^5)*(1-x^6)*(1-x^7)*(1-x^8)*(1-x^9)*(1-x^10)).A069950
Expansion of (1+x^2)*(1+x^5)*(1+x^8)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)*(1-x^5)*(1-x^6)*(1-x^7)*(1-x^8)*(1-x^9)*(1-x^10)).
- Continued fraction expansion of the number e^(2/3).A069951
Continued fraction expansion of the number e^(2/3).
- Numbers k such that (k+1)*phi(k) is a perfect square.A069952
Numbers k such that (k+1)*phi(k) is a perfect square.
- Composite n such that (n-1)*phi(n) is a perfect square.A069953
Composite n such that (n-1)*phi(n) is a perfect square.
- a(n) = binomial(2^(n+1), 2^n)/2 = binomial(2^(n+1) - 1, 2^n) = binomial(2^(n+1) - 1, 2^n-1).A069954
a(n) = binomial(2^(n+1), 2^n)/2 = binomial(2^(n+1) - 1, 2^n) = binomial(2^(n+1) - 1, 2^n-1).
- Let W(n) = Product_{k=1..n} (1 - 1/(4*k^2)), the partial Wallis product (lim_{n->oo} W(n) = 2/Pi); then a(n) = numerator(W(n)).A069955
Let W(n) = Product_{k=1..n} (1 - 1/(4*k^2)), the partial Wallis product (lim_{n->oo} W(n) = 2/Pi); then a(n) = numerator(W(n)).
- Expansion of (1+x^2)/((1-x)^2*(1-x^2)^2*(1-x^3)^2*(1-x^8)*(1-x^9)*(1-x^10)).A069956
Expansion of (1+x^2)/((1-x)^2*(1-x^2)^2*(1-x^3)^2*(1-x^8)*(1-x^9)*(1-x^10)).
- Expansion of 1/((1-x)^2*(1-x^2)^2*(1-x^3)*(1-x^4)^2*(1-x^5)).A069957
Expansion of 1/((1-x)^2*(1-x^2)^2*(1-x^3)*(1-x^4)^2*(1-x^5)).
- (Sum of digits of n)^3 - (sum of digits^3 of n).A069958
(Sum of digits of n)^3 - (sum of digits^3 of n).
- Define C(n) by the recursion C(0) = 2*i where i^2 = -1, C(n+1) = 1/(1 + C(n)), then a(n) = 2*(-1)^n/Im(C(n)) where Im(z) denotes the imaginary part of the complex number z.A069959
Define C(n) by the recursion C(0) = 2*i where i^2 = -1, C(n+1) = 1/(1 + C(n)), then a(n) = 2*(-1)^n/Im(C(n)) where Im(z) denotes the imaginary part of the complex number z.
- Define C(n) by the recursion C(0) = 3*i where i^2 = -1, C(n+1) = 1/(1 + C(n)), then a(n) = 3*(-1)^n/Im(C(n)) where Im(z) denotes the imaginary part of the complex number z.A069960
Define C(n) by the recursion C(0) = 3*i where i^2 = -1, C(n+1) = 1/(1 + C(n)), then a(n) = 3*(-1)^n/Im(C(n)) where Im(z) denotes the imaginary part of the complex number z.