20812

Appears in sequences

• a(n) = (2*n - 1)*n^2.at n=22A015237
• Numbers k such that 6*10^k+1 is prime.at n=25A056805
• a(n) = floor(average of first n cubes).at n=42A078618
• Row sums of A128623.at n=42A128624
• First differences of A007878.at n=7A138787
• Number of binary words of length n containing at least one subword 10^{7}1 and no subwords 10^{i}1 with i<7.at n=48A143287
• Triangle read by rows: T(n,k) is the number of Dyck n-paths containing k even-length ascents (0 <= k <= floor(n/2)).at n=38A143950
• a(n) = 11*n*(n+1).at n=43A164136
• Integer averages of the first perfect cubes up to some n^3.at n=31A164577
• Row sums of the triangle in A199332.at n=42A199771
• Number of 0..n arrays x(0..2) of 3 elements with each no smaller than the sum of its previous elements modulo (n+1).at n=41A200252
• Number of (w,x,y,z) with all terms in {0,...,n}, w even, and x = y + z.at n=42A212760
• Number of (n+1)X(2+1) 0..2 arrays with the maximum plus the upper median plus the lower median plus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=3A237369
• Number of (n+1)X(4+1) 0..2 arrays with the maximum plus the upper median plus the lower median plus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=1A237371
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the upper median plus the lower median plus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=11A237375
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the upper median plus the lower median plus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=13A237375
• 25-gonal numbers: a(n) = n*(23*n-21)/2.at n=43A255184
• a(n) = number of steps to reach 0 when starting from k = n^3 and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm.at n=56A261227
• Number of (n+1)X(3+1) arrays of permutations of 0..n*4+3 with each element having directed index change -1,1 0,-1 0,1 or 1,0.at n=7A264501
• Numbers that are values of the totient function (A002202) but not of the reduced totient function (A002174).at n=8A270265