22518

Appears in sequences

• Number of partitions of n into >= 2 parts and with minimum part >= 2.at n=47A083751
• Sizes of successive increasing gaps between 3-smooth numbers.at n=41A084788
• a(n) = floor(7^n/2^n).at n=8A094970
• Numbers n such that 3*10^n + 2*R_n - 1 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=12A102966
• Matrix cube of triangle A107876; equals the product of triangular matrices: A107876^3 = A107862^-1*A107873.at n=49A107884
• Column 4 of triangle A107884.at n=5A107888
• Number of permutations of length n which avoid the patterns 1234, 2341, 4312.at n=12A116750
• Number of partitions of n in which both smallest and largest part occur only once.at n=47A117995
• Triangle read by rows: characteristic polynomials of certain matrices, see Mathematica program.at n=49A124040
• Binomial transform of [1, 11, 11, 11, ...].at n=11A139635
• Triangle read by rows: T(n,k) is the number of peakless Motzkin paths of length n and having k UHD's starting at level 0; here U=(1,1), H=(1,0), and D=(1,-1).at n=45A190170
• Number of peakless Motzkin paths of length n having no UHD's starting at level 0; here U=(1,1), H=(1,0), and D=(1,-1).at n=15A190171
• Floor((3*n+1/n)^n).at n=3A197323
• Number of distinct connected planar figures that can be formed from n 1 X 2 rectangles (or dominoes).at n=5A216598
• a(n) = floor((n + 1/2)^8).at n=3A219091
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 62", based on the 5-celled von Neumann neighborhood.at n=38A270081
• Number of separable partitions of n; see Comments.at n=39A325534
• Primitive practical numbers of the form 2 * 3^i * prime(k).at n=31A367481
• Except a(0)=1 and a(4)=0, number of integer partitions of n with no 1's and at least two parts.at n=48A379720
• a(n) = Sum_{k=0..floor(n/2)} 3^k * 2^(n-2*k) * binomial(k,n-2*k)^2.at n=11A387481