18752

Appears in sequences

• Number of points on surface of dodecahedron: a(n) = 30*n^2 + 2 for n > 0.at n=25A005903
• Coordination sequence for Cr3Si, Si position.at n=35A009927
• Open 3-dimensional ball numbers (version 2): a(n) is the number of integer points (i,j,k) contained in an open ball of diameter n, centered at (1/2,0,0).at n=33A053594
• Third step in Goodstein sequences, i.e., g(5) if g(2)=n: write g(4)=A057650(n) in hereditary representation base 4, bump to base 5, then subtract 1 to produce g(5).at n=13A059934
• Maximal number of regions obtained by a straight line drawing of the complete bipartite graph K_{n,n}.at n=16A117717
• a(n) = ((1+sqrt(3))*(5+sqrt(3))^n + (1-sqrt(3))*(5-sqrt(3))^n)/2.at n=5A162272
• Number of permutations of 1..n with the permutation and its inverse having the same number of maxima.at n=7A180391
• Numbers m having the same sum of divisors as m+20 has.at n=31A181647
• Convolution of Fibonacci numbers and positive integers repeated three times (A000045 and A008620).at n=20A213044
• Goodstein sequence starting with 15.at n=3A222117
• Number of partitions of n such that the number of parts is not a part and the number of distinct parts is a part.at n=42A241378
• Number of partitions p of n such that the number of distinct parts is not a part and max(p) - min(p) is not a part.at n=40A241390
• Numbers m such that sigma(m) is a partition number.at n=21A252891
• Numbers k that are a substring of k*(k-1).at n=22A316263
• Number of n-step self-avoiding walks on a square lattice where no step can be in the same direction as the previous step.at n=18A337353
• Number of ways of placing n non-attacking queens on an n X n board, with no three queens in a straight line.at n=15A365437
• a(n) = Sum_{k=0..n} (-1)^k * (k+1) * binomial(5*n-4*k+1,n-k)/(5*n-4*k+1).at n=6A390741