23576

Appears in sequences

• Number of n-vertex labeled graphs that are gracefully labeled trees.at n=9A033472
• a(n) = n^3 - n^2 + n - 1 = (n-1) * (n^2 + 1).at n=29A062158
• Least multiple of prime(n) beginning with the concatenation of first n primes.at n=3A095220
• Numbers n such that p(12n) is prime, where p(n) is the number of partitions of n.at n=25A115214
• Let S be a string of n 2's and 3's, with curling number k, which means S = XY^k where k is maximized; a(n) = number of S for which X must be taken to be the empty string.at n=44A216951
• Tribonacci-like sequence a(n) = a(n-1) + a(n-2) + a(n-3) for n >= 3, with a(0) = 1, a(1) = 2, a(2) = 0.at n=18A276658
• G.f. A(x) satisfies: A(x) = Product_{k>=1} (1 + x^k*A(x)^k)^k.at n=8A301456
• Irregular triangle read by rows: T(n,k) = total number of graceful labelings of connected graphs with n edges (n>=1) and k vertices (k>=1).at n=53A329790
• Expansion of e.g.f. 1/(1 - x^2 * (exp(x) - 1)).at n=8A358013