25131

Appears in sequences

• a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 3), t = A023532.at n=15A024314
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers >= 3), t = (Lucas numbers).at n=14A024877
• Odd numbers in sorted order from generation 2 onwards.at n=34A048462
• Numbers such that the sum of the factorials of the digits of the fourth power is a square.at n=36A126077
• Number of (w,x,y,z) with all terms in {1,...,n} and w^2<x^2+y^2+z^2.at n=13A212092
• Number of nX3 0..1 arrays with every element equal to 1, 2, 3, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=5A302948
• T(n,k) = Number of n X k 0..1 arrays with every element equal to 1, 2, 3, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=33A302953
• Number of 6Xn 0..1 arrays with every element equal to 1, 2, 3, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=2A302957