57345

Appears in sequences

• a(n) = Sum_{k=0..n-2} T(n,k) * T(n,k+2), with T given by A026780.at n=6A027249
• Smallest number > 1 equal to sum of n-th powers of its base-3 digits, or 0 if no such number exists (written in base 10).at n=12A033835
• a(0) = 8; for n>0, a(n) = 2*a(n-1) - 1.at n=13A083686
• a(n) = Sum_{k=0..n} (-1)^(n-k)*A000041(k).at n=46A087787
• For a given unrestricted partition pi, let P(pi)=lambda(pi), if mu(pi)=0. If mu(pi)>0 then let P(pi)=nu(pi), where nu(pi) is the number of parts of pi greater than mu(pi), mu(pi) is the number of ones in pi and lambda(pi) is the largest part of pi.at n=45A100818
• A007318 * A131055.at n=13A131056
• a(n) = 56*n^2 + 1.at n=32A158660
• Base-3 perfect digital invariants (written in base 10): numbers equal to the sum of the k-th powers of their base-3 digits, for some k.at n=28A162216
• Number of 2's in the last section of the set of partitions of n.at n=48A182712
• Number of 2's in all partitions of 2n that do not contain 1 as a part.at n=24A182716
• 4-step Fibonacci sequence starting with 1,0,1,0.at n=20A251656
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 262", based on the 5-celled von Neumann neighborhood.at n=15A280415
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 294", based on the 5-celled von Neumann neighborhood.at n=15A280608
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 390", based on the 5-celled von Neumann neighborhood.at n=15A281737
• a(n) is that generation of the rule-30 1D cellular automaton started from a single ON cell in which n successive OFF cells appears for the first time after a(n-1).at n=35A319606
• Integers of the form k*2^m + 1 where 0 < k <= m and k is odd.at n=48A361875