55468

Appears in sequences

• Numbers n such that n is a substring of its square (both n and n squared in base 4) (written in base 10).at n=35A018828
• Number of partitions of n having no parts with multiplicity 3.at n=45A118807
• Number of n step walks (each step +/- 1 starting from 0) which are never more than 6 or less than -6.at n=16A235701
• Number of partitions of n into parts of exactly three sorts which are introduced in ascending order such that sorts of adjacent parts are different.at n=13A320545
• Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with circumference k, (n >= 3, k >= 3).at n=26A325455
• Numbers of squares formed by this procedure on n-th step: Step 1, draw a unit square. Step n, draw a unit square with center in every intersection of lines of the figure in step n-1.at n=27A336288
• a(n) = Sum_{k=0..n} (2*k+1) * binomial(2*k,k) * binomial(2*n-k-1,n-k).at n=6A386941