30104

Appears in sequences

• a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 3.at n=40A050035
• Maximal troughs in decimal expansions of Pi: positions of troughs equal to 8.at n=30A105276
• Row sums of pendular triangle A122445.at n=9A122452
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 1, 1), (0, 0, 1), (1, -1, 1), (1, 1, 0)}.at n=8A150263
• First differences of A160379.at n=31A163989
• Rounded error in Stirling's formula: a(n) = round(n! - exp(-n)*n^(n+1/2)*sqrt(2*Pi)).at n=10A260657
• Numbers k such that A322582(k) <= A276086(k) <= A348507(k).at n=40A392602