Sequences
392,541 sequences
- a(n) = Sum_{i=1..n} i^(n - i) + (i - n)^i.A062811
a(n) = Sum_{i=1..n} i^(n - i) + (i - n)^i.
- a(n) = Sum_{i=1..n} i^(n - i) + (-1)^(n - i)*(n - i)^i.A062812
a(n) = Sum_{i=1..n} i^(n - i) + (-1)^(n - i)*(n - i)^i.
- a(n) = Sum_{i=0..n-1} i*n^i.A062813
a(n) = Sum_{i=0..n-1} i*n^i.
- a(n) = Sum_{i=0..n-1} i * (n - i)^(n - i).A062814
a(n) = Sum_{i=0..n-1} i * (n - i)^(n - i).
- a(n) = Sum_{i=1..n} i^(i+1).A062815
a(n) = Sum_{i=1..n} i^(i+1).
- a(n) = phi(n)*tau(n) - 2n = A000010(n)*A000005(n) - 2*n.A062816
a(n) = phi(n)*tau(n) - 2n = A000010(n)*A000005(n) - 2*n.
- a(n) = Sum_{i=0..n} i^(n - i)*(n - i)^i.A062817
a(n) = Sum_{i=0..n} i^(n - i)*(n - i)^i.
- Values of Moebius transform of perfect numbers, A000396.A062818
Values of Moebius transform of perfect numbers, A000396.
- Inverse Moebius transform of perfect numbers, A000396.A062819
Inverse Moebius transform of perfect numbers, A000396.
- Sum_{k=1..n} p(k)*mu(k).A062820
Sum_{k=1..n} p(k)*mu(k).
- Number of divisors of totient of n.A062821
Number of divisors of totient of n.
- Sum of divisors of the squarefree numbers: sigma(A005117(n)).A062822
Sum of divisors of the squarefree numbers: sigma(A005117(n)).
- Numbers k such that the number of divisors of k divides the number of divisors of the totient of k.A062823
Numbers k such that the number of divisors of k divides the number of divisors of the totient of k.
- a(n) = Ch(A005117(n)) where Ch(n) is Chowla's function and A005117(n) are the squarefree numbers.A062824
a(n) = Ch(A005117(n)) where Ch(n) is Chowla's function and A005117(n) are the squarefree numbers.
- Ch(n-th nonprime) where Ch(n) is Chowla's function, cf. A048050.A062825
Ch(n-th nonprime) where Ch(n) is Chowla's function, cf. A048050.
- Square nialpdromes not ending in 0.A062826
Square nialpdromes not ending in 0.
- Variation of Stechkin's function, A055004.A062827
Variation of Stechkin's function, A055004.
- a(n) = gcd(2n, n(n+1)/2).A062828
a(n) = gcd(2n, n(n+1)/2).
- Smallest triangular numbers that contain the digits of n anywhere in their middle.A062829
Smallest triangular numbers that contain the digits of n anywhere in their middle.
- a(n) = #{ 0 <= k <= n : K(n, k) = 0 } where K(n, k) is the Kronecker symbol. This is the number of integers 0 <= k <= n that are not coprime to n.A062830
a(n) = #{ 0 <= k <= n : K(n, k) = 0 } where K(n, k) is the Kronecker symbol. This is the number of integers 0 <= k <= n that are not coprime to n.
- Number of ways n can be expressed as the sum of a nonzero square and 1 or a prime.A062831
Number of ways n can be expressed as the sum of a nonzero square and 1 or a prime.
- Numbers k such that k and k+2 have the same number of divisors.A062832
Numbers k such that k and k+2 have the same number of divisors.
- 2n! / number of divisors of n.A062833
2n! / number of divisors of n.
- Denominator of sum of first n terms of the series 1/3 + 1/8 + 1/24 ... in which the denominators are one less than a perfect square that cannot otherwise be written as a power (cf. A062757, A037450).A062834
Denominator of sum of first n terms of the series 1/3 + 1/8 + 1/24 ... in which the denominators are one less than a perfect square that cannot otherwise be written as a power (cf. A062757, A037450).
- a(1) = 0; for n > 1 a(n) = sum of divisors of n^2-1; or sigma(A005563(n-1)).A062835
a(1) = 0; for n > 1 a(n) = sum of divisors of n^2-1; or sigma(A005563(n-1)).
- Floor[ Sum_{k=1..n,p(k)^2} / Sum_{k=1..n,p(k)-1} ].A062836
Floor[ Sum_{k=1..n,p(k)^2} / Sum_{k=1..n,p(k)-1} ].
- Numbers k such that k, 2*k+1, 3*k+1 are all squarefree.A062837
Numbers k such that k, 2*k+1, 3*k+1 are all squarefree.
- Cubes of squarefree numbers.A062838
Cubes of squarefree numbers.
- a(n) = floor((prime(n-1)+prime(n+1))/2).A062839
a(n) = floor((prime(n-1)+prime(n+1))/2).
- Palindromes of the form k^3 + 1.A062840
Palindromes of the form k^3 + 1.
- Palindromes of the form k^3-1.A062841
Palindromes of the form k^3-1.
- Maximum number of zeros in the representation of n in any base.A062842
Maximum number of zeros in the representation of n in any base.
- Maximum number of ones in the representation of n in any base.A062843
Maximum number of ones in the representation of n in any base.
- Numbers that, when expressed in some base, are the concatenation of numbers in two other bases.A062844
Numbers that, when expressed in some base, are the concatenation of numbers in two other bases.
- When expressed in base 2 and then interpreted in base 3, is a multiple of the original number.A062845
When expressed in base 2 and then interpreted in base 3, is a multiple of the original number.
- When expressed in base 2 and then interpreted in base 4, is a multiple of the original number.A062846
When expressed in base 2 and then interpreted in base 4, is a multiple of the original number.
- When expressed in base 2 and then interpreted in base 6, is a multiple of the original number.A062847
When expressed in base 2 and then interpreted in base 6, is a multiple of the original number.
- When expressed in base 2 and then interpreted in base 7, is a multiple of the original number.A062848
When expressed in base 2 and then interpreted in base 7, is a multiple of the original number.
- When expressed in base 2 and then interpreted in base 8, is a multiple of the original number.A062849
When expressed in base 2 and then interpreted in base 8, is a multiple of the original number.
- When expressed in base 2 and then interpreted in base 9, is a multiple of the original number.A062850
When expressed in base 2 and then interpreted in base 9, is a multiple of the original number.
- Number of k such that 1 < k < n X n and k not of the form ij for 1 <= {i, j} <= n.A062851
Number of k such that 1 < k < n X n and k not of the form ij for 1 <= {i, j} <= n.
- Largest n-digit strong pseudoprimes (in base 2).A062852
Largest n-digit strong pseudoprimes (in base 2).
- When expressed in base 3 and then interpreted in base 4, is a multiple of the original number.A062853
When expressed in base 3 and then interpreted in base 4, is a multiple of the original number.
- First differences of A027424.A062854
First differences of A027424.
- First differences of A062851.A062855
First differences of A062851.
- In the square multiplication table of size A062857(n), the smallest number which appears n times.A062856
In the square multiplication table of size A062857(n), the smallest number which appears n times.
- Size of smallest square multiplication table which contains some number at least n times.A062857
Size of smallest square multiplication table which contains some number at least n times.
- In the triangular multiplication table of size A062859(n), the smallest number which appears n times.A062858
In the triangular multiplication table of size A062859(n), the smallest number which appears n times.
- Size of smallest triangular multiplication table which contains some number n times.A062859
Size of smallest triangular multiplication table which contains some number n times.
- Smallest j with n nodes in its riff (rooted index-functional forest).A062860
Smallest j with n nodes in its riff (rooted index-functional forest).