28426

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = (primes).at n=23A024597
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = (primes).at n=22A025111
• a(n) = (2*n-1)*(n^2 -n +2)/2.at n=30A063488
• a(n) = 25*n^2 - 14*n + 2.at n=34A154357
• Number of (n+2) X 3 binary arrays avoiding patterns 001 and 010 in rows and columns.at n=5A202609
• Number of (n+2)X8 binary arrays avoiding patterns 001 and 010 in rows and columns.at n=0A202614
• T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 010 in rows and columns.at n=15A202616
• T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 010 in rows and columns.at n=20A202616
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically.at n=47A207442
• Number of 3Xn 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically.at n=7A207443
• Total number of noncomposite parts in all partitions of n.at n=28A326957
• Divide the positive integers into subsets of lengths given by successive primes. a(n) is the sum of primes contained in the n-th subset.at n=31A344718
• Irregular triangle read by rows: T(n,k) is the number of non-isomorphic directed graphs reachable in k steps (and no fewer) by n agents using the LNS protocol (see A307085); n >= 1, 0 <= k <= A383387(n).at n=52A383385