129606

Appears in sequences

• Values of n such that N=(an+1)(bn+1)(cn+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,33.at n=28A064253
• a(n) = 3600*n^2 + n.at n=5A157861
• a(n) = number of steps to reach 0 when starting from k = 3^n and repeatedly applying the map that replaces k with k - (sum of digits in base-3 representation of k).at n=13A261232
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,0) = 0^n and T(n,k) = k * Sum_{r=0..n} binomial(n+2*r+k,r) * binomial(r,n-r)/(n+2*r+k) for k > 0.at n=62A378290