28338

Appears in sequences

• Number of partitions satisfying cn(2,5) <= cn(0,5) + cn(3,5) and cn(2,5) <= cn(0,5) + cn(4,5) and cn(3,5) <= cn(0,5) + cn(1,5) and cn(3,5) <= cn(0,5) + cn(4,5).at n=44A039875
• Maximal value of Sum_{i=1..n} (p(i) - p(i+1))^2, where p(n+1) = p(1), as p ranges over all permutations of {1, 2, ..., n}.at n=43A064842
• Numbers n such that 7*10^n + 3 is prime.at n=14A097970
• a(n) = Sum_{j=1..n} prime(j)*2^(j-2).at n=10A135483
• Numbers k such that k and k^2 use only the digits 0, 2, 3, 4 and 8.at n=32A136885
• G.f.: A(x) = 1 + x*G(x)/F(x) where F(x) = A(x/F(x)) and G(x) = A(x*G(x)).at n=9A184506
• Numbers k such that the five numbers k^2+1, (k+1)^2+1, ..., (k+4)^2+1 are all semiprime.at n=4A261546
• a(n) = 27*n^2/2 + 45*n/2 - 12 (n>=1).at n=44A304375
• a(n) = Sum_{k=1..n} floor(n/(2*k-1))^3.at n=29A350144
• G.f. satisfies A(x) = 1/(1-x) + x^4*A(x)^4.at n=16A364591
• Number of regions in a graph of n adjacent rectangles in a row with all possible diagonals drawn, as in A306302, but without the rectangles' edges which are perpendicular to the row.at n=19A369175