27476

Appears in sequences

• Apply partial sum operator 4 times to Fibonacci numbers.at n=15A014166
• a(n) = T(2n, n+2), T given by A027935.at n=7A027938
• Numbers k such that [prime(k), prime(k+1), prime(k+2), prime(k+3)] == [1, 2, 3, 4] (mod 11).at n=2A302772
• Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with k arcs and a global source (or sink), n >= 1, k = 0..(n-1)^2.at n=50A350797
• Number of non-subset-sums of strict integer partitions of n.at n=42A365922