29590

Appears in sequences

• Growth function of an infinite cubic graph (number of nodes at distance <=n from fixed node).at n=40A038621
• Difference between sum of largest parts and sum of smallest parts of all partitions of n into an even number of parts.at n=31A211881
• a(n) = n*(3*n^2 - 5*n + 3).at n=22A226450
• Number of nX4 0..1 arrays with each 1 adjacent to 2, 4 or 5 king-move neighboring 1s.at n=6A296970
• Number of nX7 0..1 arrays with each 1 adjacent to 2, 4 or 5 king-move neighboring 1s.at n=3A296973
• T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 2, 4 or 5 king-move neighboring 1s.at n=48A296974
• T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 2, 4 or 5 king-move neighboring 1s.at n=51A296974
• Triangle read by rows: Take a pentagon with all diagonals drawn, as in A331929. Then T(n,k) = number of k-sided polygons in that figure for k = 3, 4, ..., n+5.at n=49A331939
• Number of ways to write n as an ordered sum of 5 prime powers (including 1).at n=46A341134
• Consecutive states of the linear congruential pseudo-random number generator (25173*s+13849) mod 2^16 when started at s=1.at n=25A383940