26590

Appears in sequences

• a(0) = 1, a(n) = 23*n^2 + 2 for n>0.at n=34A010013
• Closed 3-dimensional ball numbers (version 2): a(n)= number of integer points (i,j,k) contained in a closed ball of diameter n, centered at (1/2,0,0).at n=37A053593
• Numbers that contain as proper substrings every maximal prime power dividing them.at n=27A059401
• Let P(A) denote the power set of an n-element set A. Then a(n) = the number of pairs of elements {x,y} of P(A) for which either 0) x and y are disjoint and for which x is not a subset of y and y is not a subset of x, 1) x and y are disjoint and for which either x is a subset of y or y is a subset of x, or 2) x and y intersect but for which x is not a subset of y and y is not a subset of x.at n=8A133789
• Number of n-step three-sided prudent self-avoiding walks.at n=10A191823
• Expansion of 1/(1 - x - x^2 - x^6 + x^8).at n=21A225391
• E.g.f.: 1 / (1 - x * (2 + x) * exp(x)).at n=5A336960