157696

Appears in sequences

• a(1) = 2; for n > 0, a(n+1) = a(n) * sum of digits of a(n).at n=6A047892
• Generalized Catalan numbers C(8,8; n).at n=4A064346
• G.f. A(x) satisfies: 5^n - 1 = Sum_{k=0..n} [x^k]A(x)^n and also satisfies: (5+z)^n - (1+z)^n + z^n = Sum_{k=0..n} [x^k](A(x)+z*x)^n for all z, where [x^k]A(x)^n denotes the coefficient of x^k in A(x)^n.at n=11A100231
• Triangular sequence from a Pidduck polynomials expansion: p(t) = (t/(1 - t))*((1 + t)/(1 - t))^x.at n=31A137394
• Number of n X 3 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=11A281200
• Nonprime Heinz numbers of integer partitions whose product is equal to their sum.at n=21A301988
• Dirichlet g.f.: (zeta(s-3) / zeta(s))^2.at n=31A338165
• Positions of records in A116489.at n=33A342868
• Expansion of (1/x) * Series_Reversion( x * ((1-x)^4+x^4) ).at n=6A369124
• Triangle T(n,k) read by rows in which n-th row lists in increasing order all multiplicative partitions mu of n whose sum is also n (with factors >= 1), encoded as Product_{j in mu} prime(j); n>=1, 1<=k<=A001055(n).at n=39A377852