29579

Appears in sequences

• Number of connected trivalent bipartite graphs with 2n nodes.at n=9A006823
• Triangle read by rows: T(n,k) is the number of simple regular connected bipartite graphs with 2n nodes and degree k, (2 <= k <= n).at n=56A008326
• Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=10, k=0 and l=1.at n=6A177131
• Smallest positive integer such that n iterations of A073846 are required to reach an even number.at n=12A263570
• Irregular triangle read by rows: T(0, 0) = 2; T(i, j) is the j-th term in the least maximal chain of composites that is longer than the (i-1)-st least maximal chain of composites, where i>0.at n=45A271363
• Numbers k such that (107*10^k + 13)/3 is prime.at n=23A291659
• Expansion of Product_{k>=1} 1/(1 - x^k)^(d(k)-1), where d(k) = number of divisors of k (A000005).at n=35A318783