23253

Appears in sequences

• Let A(x) satisfy: A(x) = 1 + x*A(x)^phi where phi = (sqrt(5)+1)/2, then this sequence equals the integer part of the coefficients of A(x).at n=13A184785
• Number of (w,x,y,z) with all terms in {1,...,n} and w^2<x*y*z.at n=13A212063
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 193", based on the 5-celled von Neumann neighborhood.at n=33A270687
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 934", based on the 5-celled von Neumann neighborhood.at n=40A273794
• Numbers k == 33 (mod 60) such that 2k+1, 2k+5, 3k+2 and 3k+8 are all primes.at n=6A283552
• Times on a 12-hour digital clock with 6 digits at which the three continuously moving hands of an analog clock, in the best approximation, enclose the same angles with one another, i.e., have the smallest sum of squares of the deviations from 120 degrees. When interpreting the terms as times of the day in the form hh:mm:ss, padding to the left with zeros is assumed.at n=4A347040
• Euler transform of 2^floor(n/2), (A016116).at n=17A358369
• Number of integer partitions of n containing all divisors of all parts.at n=45A371178
• Number of integer partitions of n with exactly as many ones as the next greatest multiplicity.at n=52A382303
• Composite numbers that contain only prime digits and whose prime factors contain only prime digits.at n=31A387093