Sequences
392,541 sequences
- a(n) = 3^n*n^(n-1).A038061
a(n) = 3^n*n^(n-1).
- Number of labeled trees with 3-colored nodes.A038062
Number of labeled trees with 3-colored nodes.
- Product_{k>=1}1/(1 - x^k)^a(k) = 1 + 2x.A038063
Product_{k>=1}1/(1 - x^k)^a(k) = 1 + 2x.
- Product_{k>=1} 1/(1 - x^k)^a(k) = 1 + 3x.A038064
Product_{k>=1} 1/(1 - x^k)^a(k) = 1 + 3x.
- Product_{k>=1} 1/(1 - x^k)^a(k) = 1 + 4x.A038065
Product_{k>=1} 1/(1 - x^k)^a(k) = 1 + 4x.
- Product_{k>=1} 1/(1 - x^k)^a(k) = 1 + 5x.A038066
Product_{k>=1} 1/(1 - x^k)^a(k) = 1 + 5x.
- Product_{k>=1} (1 + x^k)^a(k) = 1 + 2x.A038067
Product_{k>=1} (1 + x^k)^a(k) = 1 + 2x.
- Product_{k>=1}(1 + x^k)^a(k) = 1 + 3x.A038068
Product_{k>=1}(1 + x^k)^a(k) = 1 + 3x.
- Product_{k>=1} ((1 + x^k)^a(k)) = 1 + 4x.A038069
Product_{k>=1} ((1 + x^k)^a(k)) = 1 + 4x.
- Product_{k>=1} (1+x^k)^a(k) = 1 + 5x.A038070
Product_{k>=1} (1+x^k)^a(k) = 1 + 5x.
- Shifts left under inverse Euler transform.A038071
Shifts left under inverse Euler transform.
- Shifts left under Euler transform.A038072
Shifts left under Euler transform.
- Shifts left under Weigh transform.A038073
Shifts left under Weigh transform.
- Shifts left and changes sign under Weigh transform.A038074
Shifts left and changes sign under Weigh transform.
- Number of rooted identity trees with 2-colored leaves.A038075
Number of rooted identity trees with 2-colored leaves.
- Number of rooted identity trees with 3-colored leaves.A038076
Number of rooted identity trees with 3-colored leaves.
- Number of rooted identity trees with 2-colored nodes.A038077
Number of rooted identity trees with 2-colored nodes.
- Number of identity trees with 2-colored nodes.A038078
Number of identity trees with 2-colored nodes.
- Number of rooted identity trees with 3-colored nodes.A038079
Number of rooted identity trees with 3-colored nodes.
- Number of identity trees with 3-colored nodes.A038080
Number of identity trees with 3-colored nodes.
- Number of rooted identity trees of height n. Sets of rank n.A038081
Number of rooted identity trees of height n. Sets of rank n.
- Number of n-node rooted identity trees of height at most 3.A038082
Number of n-node rooted identity trees of height at most 3.
- Number of n-node rooted identity trees of height at most 4.A038083
Number of n-node rooted identity trees of height at most 4.
- Number of n-node rooted identity trees of height at most 5.A038084
Number of n-node rooted identity trees of height at most 5.
- Number of n-node rooted identity trees of height at most 6.A038085
Number of n-node rooted identity trees of height at most 6.
- Number of n-node rooted identity trees of height at most 7.A038086
Number of n-node rooted identity trees of height at most 7.
- Number of n-node rooted identity trees of height at most 8.A038087
Number of n-node rooted identity trees of height at most 8.
- Number of n-node rooted identity trees of height 4.A038088
Number of n-node rooted identity trees of height 4.
- Number of n-node rooted identity trees of height 5.A038089
Number of n-node rooted identity trees of height 5.
- Number of n-node rooted identity trees of height 6.A038090
Number of n-node rooted identity trees of height 6.
- Number of n-node rooted identity trees of height 7.A038091
Number of n-node rooted identity trees of height 7.
- Number of n-node rooted identity trees of height 8.A038092
Number of n-node rooted identity trees of height 8.
- Number of nodes in largest rooted identity tree of height n.A038093
Number of nodes in largest rooted identity tree of height n.
- Number of rooted graphs on n labeled nodes where the root has degree 2.A038094
Number of rooted graphs on n labeled nodes where the root has degree 2.
- Number of rooted connected graphs on n labeled nodes where the root has degree 2.A038095
Number of rooted connected graphs on n labeled nodes where the root has degree 2.
- Number of rooted graphs on n labeled nodes where the root has degree 3.A038096
Number of rooted graphs on n labeled nodes where the root has degree 3.
- Number of rooted connected graphs on n labeled nodes where the root has degree 3.A038097
Number of rooted connected graphs on n labeled nodes where the root has degree 3.
- Number of primes < n^3.A038098
Number of primes < n^3.
- Numbers k such that k > first location of string of k in decimal expansion of Pi.A038099
Numbers k such that k > first location of string of k in decimal expansion of Pi.
- Numbers k such that k < first location of string of k in decimal expansion of Pi.A038100
Numbers k such that k < first location of string of k in decimal expansion of Pi.
- First location of palindrome a(n) in decimal expansion of Pi is palindromic.A038101
First location of palindrome a(n) in decimal expansion of Pi is palindromic.
- Numbers k such that k is a substring of its base-2 representation.A038102
Numbers k such that k is a substring of its base-2 representation.
- Numbers k such that k is a substring of its base-3 representation.A038103
Numbers k such that k is a substring of its base-3 representation.
- Numbers n with property that n is a substring of its base 4 representation.A038104
Numbers n with property that n is a substring of its base 4 representation.
- Numbers n with property that n is a substring of its base 5 representation.A038105
Numbers n with property that n is a substring of its base 5 representation.
- Numbers k with the property that k is a substring of its base-6 representation.A038106
Numbers k with the property that k is a substring of its base-6 representation.
- Number of primes < n^2.A038107
Number of primes < n^2.
- Number of prime pairs {p,q}, such that pq < n^2.A038108
Number of prime pairs {p,q}, such that pq < n^2.
- Divisible exactly by the square of a prime.A038109
Divisible exactly by the square of a prime.
- Numerator of frequency of integers with smallest divisor prime(n).A038110
Numerator of frequency of integers with smallest divisor prime(n).