23536

Appears in sequences

• Number of points on surface of truncated tetrahedron: a(n) = 14*n^2 + 2 for n > 0, a(0)=1.at n=41A005905
• Number of down-up permutations of n+4 starting with 4.at n=7A006216
• Triangle of Euler-Bernoulli or Entringer numbers read by rows: T(n,k) is the number of down-up permutations of n+1 starting with k+1.at n=47A008282
• Read across rows of Euler-Bernoulli or Entringer triangle.at n=30A008283
• Coordination sequence for {A_7}* lattice.at n=6A008535
• Triangle of Euler-Bernoulli or Entringer numbers.at n=52A010094
• Number of walks of length n on square lattice, starting at origin, staying in first and third quadrants.at n=8A060897
• Triangle in which rows are permutations of the rows of A008282.at n=50A064192
• Numbers n such that n = pi(n)*k + 1 for some k.at n=29A065136
• Reflection of triangle in A008280 in vertical axis.at n=58A108040
• Triangle T(n,k) = 2*T(n-1, k-1) + 2*T(n-1, k), read by rows.at n=49A142595
• Triangle T(n,k) = 2*T(n-1, k-1) + 2*T(n-1, k), read by rows.at n=50A142595
• Triangular array: the fission of ((x+1)^n) by ((2x+1)^n).at n=40A193858
• Mirror of the triangle A193858.at n=40A193859
• Partial sums of A029940 (Product_{d|n} phi(d)).at n=35A280131
• a(n) = a(n-1) + a(n-2) - n*a(floor(n/2)), where a(0) = 1, a(1) = 1, a(2) = 1.at n=20A298400
• Total height of the binary search trees summed over all permutations of [n].at n=7A316944
• a(n) is the number of integer partitions of n for which the smallest part is equal to the index of the seaweed algebra formed by the integer partition paired with its weight.at n=55A318196
• Number of regions in a polygon whose boundary consists of n+2 equally spaced points around a semicircle and n+2 equally spaced points along the diameter (a total of 2n+2 points). See Comments for precise definition.at n=15A333519
• a(n) = Sum_{k=1..n} floor(n/k)^k.at n=23A345176