48401

Appears in sequences

• A Binet type formula from a polynomial whose coefficient expansion gives a tribonacci used as it first derivative InverseZtransform: A000073.at n=11A116574
• a(n) = 81*n^2 - 90*n + 26.at n=25A154295
• Number of (n+1)X(n+1) 0..2 arrays with no 2X2 subblock having the same number of equal edges as its horizontal or vertical neighbors, and new values 0..2 introduced in row major order.at n=2A205582
• Number of (n+1)X4 0..2 arrays with no 2X2 subblock having the same number of equal edges as its horizontal or vertical neighbors, and new values 0..2 introduced in row major order.at n=2A205585
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no 2X2 subblock having the same number of equal edges as its horizontal or vertical neighbors, and new values 0..2 introduced in row major order.at n=12A205590
• Numbers of the form n^2 + 1 without prime divisors of the form a^2 + 1.at n=20A217279
• A239459(n) / n.at n=21A239462
• Number of n X 4 0..1 arrays with every element unequal to 0, 1, 2, 4 or 6 king-move adjacent elements, with upper left element zero.at n=9A304475
• a(n) = 1 + 100*n^2 for n >= 0.at n=22A323178
• Triangle read by rows: T(n,k) is the number of unlabeled connected multigraphs with n edges on k nodes and degree >= 3 at each node, loops allowed, n >= 2, 1 <= k <= floor(2*n/3).at n=52A360862