18888

Appears in sequences

• Series-parallel numbers.at n=3A000527
• Terms of A001273 with trailing 9's stripped (at n=13 term becomes periodic with period 49).at n=47A018785
• a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = A001950 (upper Wythoff sequence).at n=30A024689
• Numbers whose maximal base-10 run length is 4.at n=25A033285
• Triangle of series-parallel numbers.at n=32A036654
• Smallest positive number that needs more lines when shown on a 7-segment display (digital clock) than any previous term.at n=25A038619
• Numbers having four 8's in base 10.at n=1A043524
• Write 0, 1, ..., n in binary and add as if they were decimal numbers.at n=16A067894
• Number of ways of writing n as the sum of n triangular numbers.at n=11A106337
• Triangle, read by rows, where g.f. of row n equals the product of (1-x)^n and the g.f. of the coordination sequence for root lattice B_n, for n >= 0.at n=41A109001
• The number of n-almost primes less than or equal to e^n, starting with a(0)=1.at n=27A116432
• Partial sums of A051109.at n=12A117727
• Where record values occur in A010371.at n=23A143617
• T(n,k) = Number of n-step self-avoiding walks on a k X k X k cube summed over all starting positions.at n=39A187162
• Number of 4-step self-avoiding walks on an n X n X n cube summed over all starting positions.at n=5A187165
• Number of partitions of 5n such that cn(0,5) <= cn(1,5) = cn(4,5) = cn(2,5) = cn(3,5).at n=14A202087
• Number of n X 5 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors.at n=6A208634
• Number of 7 X n 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors.at n=4A208642
• Smallest positive number using exactly n segments on a calculator display (when '6' and '7' are represented using 6 resp. 3 segments).at n=28A216261
• Number of ways of writing n as the sum of 11 triangular numbers.at n=11A226255