52944

Appears in sequences

• Number of graphs with n edges.at n=12A000664
• Number of non-well-founded sets or hypersets (sets that can contain themselves) of level n (representable by graphs with n nodes).at n=4A027607
• G.f. A(x) satisfies: A(x) = Sum_{n>=0} [x*A(x)]^(2^n-1).at n=14A134527
• Triangle T, read by rows, where the g.f. of column k in matrix power T^m is given by: 1/(1-x)^m = Sum_{n>=k} [T^m](n,k) * x^(n-k)/(1+x)^{n(n-1)/2 - k(k-1)/2} for k>=0.at n=59A141760
• Column 4 of triangle A141760.at n=6A141764
• 2-adic valuation of A052129.at n=17A238462
• Expansion of triangle T(n,k) of p-adic valuations of A052129(n) (Somos' quadratic recurrence sequence).at n=62A239148
• a(n) = 256n^2 - 828n + 656 (n>=1).at n=15A304379