52486

Appears in sequences

• A simple grammar: cycles of pairs of sequences.at n=20A052823
• Number of connected unlabeled vertex-transitive graphs with n nodes such that complement is also connected.at n=40A054917
• a(n) = 3*a(n-1)+4 for n > 0; a(0) = 6.at n=8A171495
• Number of -5..5 arrays x(0..n-1) of n elements with nonzero sum and with zero through n-1 differences all nonzero.at n=4A200162
• T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with nonzero sum and with zero through n-1 differences all nonzero.at n=40A200165
• Number of -n..n arrays x(0..4) of 5 elements with nonzero sum and with zero through 4 differences all nonzero.at n=4A200168
• Numbers n such that the n-th digit (after the decimal point) in the decimal expansion of Pi are the occurrence of the least significant digit represented by the more significant digits.at n=36A201545
• Triangle read by rows: T(n,k) is the number of non-isomorphic colorings of a toroidal n X k grid using exactly two colors under translational symmetry, 1 <= k <= n.at n=13A294684