130900

Appears in sequences

• Number of n-node rooted identity trees of height at most 5.at n=26A038084
• Table, read by rows, of the number of quivers of affine type A_(n-1) according to the parameter k (n >= 2, 1 <= k <= [n/2]).at n=39A189942
• Number of positive integers with n digits in which adjacent digits differ by at most 1.at n=9A235163
• Decimal representation of the n-th iteration of the "Rule 199" elementary cellular automaton starting with a single ON (black) cell.at n=8A267689
• a(n) is the number of ways of putting n labeled balls into 2 indistinguishable boxes such that each box contains at least 3 balls.at n=12A272352
• a(n) is the smallest nonnegative integer k where exactly n pairs of positive integers (x, y) exist such that x^2 + 19*y^2 = k.at n=12A374161