19990

Appears in sequences

• Numbers k such that k and k^2 use only the digits 0, 1, 3, 6 and 9.at n=50A136850
• a(1)=1, a(n) = a(n-1) + n^3 if n odd, a(n) = a(n-1) + n^1 if n is even.at n=18A140153
• 2*(10^n-5), n>0.at n=3A173813
• Expansion of -16/(sqrt(12*x+2*sqrt(1-4*x)+2)-sqrt(1-4*x)-1)^2+1/x^2-1.at n=9A239425
• Number of inequivalent ways to cut an n X n square into squares with integer sides, such that the dissection has one reflective symmetry in an axis parallel to a side, but no other symmetries.at n=8A240125
• Number of partitions p of n such that (maximal multiplicity of the parts of p) > (maximal part of p).at n=47A240314
• Indices of primes in the tetranacci sequence A000288.at n=28A247561
• Number of length n+2 0..5 arrays with the sum of medians of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=3A253126
• T(n,k)=Number of length n+2 0..k arrays with the sum of medians of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=31A253129
• Number of length 4+2 0..n arrays with the sum of medians of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=4A253132
• Number of integer partitions of n - 1 containing fewer 1's than any other part.at n=48A364159