29638

Appears in sequences

• 10-gonal (or decagonal) pyramidal numbers: a(n) = n*(n + 1)*(8*n - 5)/6.at n=28A007585
• Total number of parts smaller than the largest part, in all partitions of n.at n=27A116686
• Number of nonempty subsets of {1, 2, ..., n} with <=8 pairwise coprime elements.at n=29A187269
• Number of -4..4 arrays x(0..n-1) of n elements with zero sum and no two consecutive declines, no adjacent equal elements, and no element more than one greater than the previous (random base sawtooth pattern).at n=13A200177
• Even, nonzero decagonal pyramidal numbers.at n=13A218331
• Number of n X 7 -1,1 arrays such that the sum over i=1..n, j=1..7 of i*x(i,j) is zero and rows are nondecreasing (ways to put 7 thrusters pointing east or west at each of n positions 1..n distance from the hinge of a south-pointing gate without turning the gate).at n=6A225308
• Number of 7Xn -1,1 arrays such that the sum over i=1..7,j=1..n of i*x(i,j) is zero and rows are nondecreasing (ways to put n thrusters pointing east or west at each of 7 positions 1..n distance from the hinge of a south-pointing gate without turning the gate).at n=6A225314
• a(n) = Fibonacci(p) mod p^2, where p = prime(n).at n=58A236395
• Breadth-first traversal of a binary tree in which the value at the n-th node is equal to ParentNode()*prime(n-1).at n=21A268878
• Maximal coefficient of Product_{i=1..n} Sum_{j=0..n} x^(i*j).at n=7A369767
• Numbers whose binary expansion consists of alternating runs of 1's and 0's where each run of 0's is exactly one shorter than the preceding run of 1's, and the expansion ends with a 0-run.at n=43A387270