39260

Appears in sequences

• Number of n-node connected unicyclic graphs.at n=11A001429
• If n mod 2 = 0 then a(n) = n^4/4 - 2*n^2 + 3*n; otherwise, a(n) = n^4/4 - 2*n^2 + 3*n - 5/4.at n=20A064835
• Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={1,2}.at n=26A079963
• Array read by columns: T(n,m) = number of unlabeled graphs with n vertices and m unicyclic components.at n=26A137918
• Numbers starting with 1 such that the sum of any two distinct elements has an odd number of distinct prime factors.at n=16A180615
• Number of Latin squares of order 2n with maximum inner distance with fixed entry 1 in cell (1,1).at n=13A350453
• G.f. A(x) = Sum_{n>=0} a(n)*x^n where a(n) = Sum_{k=0..n-1} ( ([x^k] A(x)^n) (mod 2^n) ) for n > 0, with a(0) = 1.at n=13A376231
• Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with k cycles and no node a member of more than one cycle, 0 <= k <= floor(n/3).at n=41A381467