19128

Appears in sequences

• a(n) = 2^n+n^3.at n=14A097339
• Numbers k such that 2*10^k + 5*R_k + 2 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=13A099006
• Number of permutations in S_n avoiding {bar 1}3425 (i.e., every occurrence of 3425 is contained in an occurrence of a 13425).at n=8A137542
• Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^6 = I.at n=14A163876
• G.f.: exp( Sum_{n>=1} x^n/n * Product_{d|n} (1 + d*x^n)^d ).at n=22A205482
• Number of (n+1) X (1+1) 0..2 arrays with the maximum minus the upper median of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=4A237550
• Number of (n+1)X(5+1) 0..2 arrays with the maximum minus the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=0A237554
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum minus the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=10A237557
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum minus the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=14A237557
• a(n) = A330575(A025487(n)).at n=42A333962
• Number of digits of earliest prime encountered at each digit n of the decimal expansion of Pi.at n=49A343422
• Number of subsets of {1..n} with the same number of maximal runs (increasing by 1) as maximal anti-runs (increasing by more than 1).at n=17A385572