21965

Appears in sequences

• Number of series-reduced planted trees with n leaves. Also the number of essentially series series-parallel networks with n edges; also the number of essentially parallel series-parallel networks with n edges.at n=11A000669
• Number of trees by stability index.at n=19A003427
• Third column of A027516.at n=7A027530
• Triangle read by rows: T(n,m) = number of unlabeled cographs on n nodes with m connected components.at n=66A106240
• Numbers k such that 22446688 * 10^k + 1 is prime.at n=12A107280
• a(n) = (3*n+1)*(5*n+1).at n=38A144459
• a(n) = 76*n^2 + 1.at n=17A158767
• a(n) = n*(n-3)*(n^2-7*n+14)/8.at n=20A176145
• Number of (5*n)X5 binary arrays with rows in nonincreasing order, n ones in every column and no more than 3 ones in any row.at n=2A188412
• T(n,k)=Number of (n*k)Xk binary arrays with rows in nonincreasing order, n ones in every column and no more than 3 ones in any row.at n=23A188416
• Number of (3*n)Xn binary arrays with rows in nonincreasing order, 3 ones in every column and no more than 3 ones in any row.at n=4A188418
• Number of n X 4 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=8A207364
• Number of partitions of n containing at least one part m-9 if m is the largest part.at n=35A212549
• Number of series-reduced rooted trees whose leaves span an initial interval of positive integers with multiplicities the integer partition with Heinz number n.at n=36A316655
• Triangle read by rows: T(n,k) is the number of permutation graphs on n vertices with domination number k, with 1 <= k <= n.at n=29A320578
• Number of digits in the base 10 representation of floor(Bernoulli(2^n)).at n=13A336901
• A sequence of integers from an additive problem with prime numbers.at n=25A348472