142805

Appears in sequences

• Numbers of the form (5^i)*(13^j).at n=23A107466
• Triangle of coefficients in expansion of (1+13x)^n.at n=19A123187
• Triangle read by rows: T(i,j) is the number of i-permutations of 14 objects a,b,c,d,e,f,g,h,i,j,k,l,m,n, with repetition allowed, containing j a's.at n=16A133371
• Numbers n which are the hypotenuse of a Pythagorean triple with n' as a leg, where n' is the arithmetic derivative of n.at n=3A211176
• T(n,k)=Rolling icosahedron footprints: number of nXk 0..11 arrays starting with 0 where 0..11 label vertices of an icosahedron and every array movement to a horizontal, diagonal or antidiagonal neighbor moves along an icosahedral edge.at n=19A223233
• Rolling icosahedron footprints: number of 5Xn 0..11 arrays starting with 0 where 0..11 label vertices of an icosahedron and every array movement to a horizontal, diagonal or antidiagonal neighbor moves along an icosahedral edge.at n=1A223237
• Rolling icosahedron footprints: number of nX5 0..11 arrays starting with 0 where 0..11 label vertices of an icosahedron and every array movement to a horizontal or vertical neighbor moves along an icosahedral edge.at n=1A223260
• T(n,k)=Rolling icosahedron footprints: number of nXk 0..11 arrays starting with 0 where 0..11 label vertices of an icosahedron and every array movement to a horizontal or vertical neighbor moves along an icosahedral edge.at n=16A223263
• T(n,k)=Rolling icosahedron footprints: number of nXk 0..11 arrays starting with 0 where 0..11 label vertices of an icosahedron and every array movement to a horizontal or vertical neighbor moves along an icosahedral edge.at n=19A223263
• Numbers that are multiple-digit narcissistic numbers in exactly four bases.at n=10A256363
• a(n) = 5*n^4.at n=13A269792
• List of nonzero determinants of Unbordered Lights Out matrices UBL_k.at n=2A296353
• Heinz numbers of integer partitions whose reciprocal sum is 1.at n=21A316855
• Heinz numbers of aperiodic integer partitions whose reciprocal sum is 1.at n=17A316889
• Triangle read by rows: T(n, k) = binomial(n+k, n-k)/(2*k + 1) * (2*n + 1)^k.at n=25A370262
• a(n) is the smallest number k in the sorted sequence S(q) = {k : rad(k) = q}, q = A120944(n), such that tau(k) - A008479(k) is not positive, where rad = A007947 and tau = A000005.at n=20A373737