84259

Appears in sequences

• Number of unlabeled rooted trees with n nodes and maximal outdegree (branching factor) 8.at n=11A244404
• T(n,k)=Number of length n+6 0..k arrays with every seven consecutive terms having six times some element equal to the sum of the remaining six.at n=15A249359
• T(n,k)=Number of length n+6 0..k arrays with every seven consecutive terms having six times some element equal to the sum of the remaining six.at n=22A249359
• T(n,k)=Number of length n+6 0..k arrays with every seven consecutive terms having six times some element equal to the sum of the remaining six.at n=30A249359
• T(n,k)=Number of length n+6 0..k arrays with every seven consecutive terms having six times some element equal to the sum of the remaining six.at n=39A249359
• Number of length 1+6 0..n arrays with every seven consecutive terms having six times some element equal to the sum of the remaining six.at n=5A249360
• Number of length 2+6 0..n arrays with every seven consecutive terms having six times some element equal to the sum of the remaining six.at n=5A249361
• Number of length 3+6 0..n arrays with every seven consecutive terms having six times some element equal to the sum of the remaining six.at n=5A249362
• Number of length 4+6 0..n arrays with every seven consecutive terms having six times some element equal to the sum of the remaining six.at n=5A249363
• Number of length 5+6 0..n arrays with every seven consecutive terms having six times some element equal to the sum of the remaining six.at n=5A249364
• Number of length 6+6 0..n arrays with every seven consecutive terms having six times some element equal to the sum of the remaining six.at n=5A249365
• Number of length 7+6 0..n arrays with every seven consecutive terms having six times some element equal to the sum of the remaining six.at n=5A249366