61216

Appears in sequences

• Number of bicentered trees with n nodes.at n=18A000677
• Base-10 palindromes that start with 6.at n=34A043041
• Palindromes with exactly 6 prime factors (counted with multiplicity).at n=33A046332
• Smallest multiple of n which begins with R(n) and ends in n where R(n) (A004086) is the digit reversal of n. Suitable number of zeros are assumed to the left of the MSD if required.at n=15A077741
• Smallest palindromic multiple of n in which n is a substring (anywhere), or 0 if n = 10k or no such number exists.at n=15A084044
• Number of partitions of n such that the least part occurs at least twice.at n=43A117989
• Biquadrateful (i.e., not biquadrate-free) palindromes.at n=35A133514
• Number of partitions of n such that m(greatest part) <= m(1), where m = multiplicity.at n=44A240077
• Number of (n+2)X(n+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000101 or 00010001.at n=4A260169
• Number of (n+2)X(5+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000101 or 00010001.at n=4A260174
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000101 or 00010001.at n=40A260177
• Square array A(i,j), i >= 0, j >= 0, read by antidiagonals: A(i,j) = Sum_{|X|=0..i} Sum_{|Y|=0..i} Product_{k=1..j} (1+X(k)+Y(k)), where X and Y are multi-indices of length j.at n=39A358628
• Number of vertices formed when n equally spaced points are placed around a circle and all pairs of points are joined by an interior arc whose radius equals the circle's radius.at n=32A371254