21166

Appears in sequences

• Number of n-node rooted trees of height 6.at n=14A000393
• Numbers k such that 70*R_k + 3, where R_k = 11...1 is the repunit (A002275) of length k.at n=12A056689
• Output of the linear congruential pseudo-random number generator used in function rand() as described in Kernighan and Ritchie, when seeded with 0.at n=39A096554
• Number of nX5 binary arrays with top left value 1 and no two ones adjacent horizontally, vertically or nw-se diagonally.at n=5A228280
• Number of nX6 binary arrays with top left value 1 and no two ones adjacent horizontally, vertically or nw-se diagonally.at n=4A228281
• T(n,k) = Number of n X k binary arrays with top left value 1 and no two ones adjacent horizontally, vertically or nw-se diagonally.at n=49A228285
• T(n,k) = Number of n X k binary arrays with top left value 1 and no two ones adjacent horizontally, vertically or nw-se diagonally.at n=50A228285
• a(n) = 15*n^2 - 13*n.at n=38A263226
• floor(r*a(n-1)) + floor(r*a(n-2)), where r = 3/2, a(0) = 1, a(1) = 1.at n=14A275862
• Numbers k such that 24*k-1 has at least three factors 7 and the partition function evaluated at k has at least the same number of factors 7 as 24*k-1.at n=26A340957