19260

Appears in sequences

• a(n) = dot_product(1,2,...,n)*(5,6,...,n,1,2,3,4).at n=35A026043
• Where A098018(k)=-n.at n=14A098874
• a(n) is the smallest number m such that sigma(m)=n*pi(m), or 0 if no such m exists.at n=25A137602
• 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, 0), (-1, 0, 0), (0, -1, 1), (0, 1, 1), (1, 0, -1)}.at n=9A148932
• 10 times pentagonal numbers: a(n) = 5*n*(3*n-1).at n=36A153780
• Numbers n for which the terms of the multiplicative sequence {n^2/A049417(n)} are integers.at n=25A185288
• Number of nondecreasing arrangements of 4 numbers in -(n+2)..(n+2) with sum zero.at n=40A188212
• Number of (1+1) X (n+1) 0..1 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=10A250798
• Numbers n such that there exists an x!=n that makes {n,n,x} an amicable multiset.at n=2A259302
• Numbers that belong to at least one amicable multiset.at n=33A259307
• Abundant numbers n such that sigma(sigma(n) - 2*n) = sigma(n).at n=4A292365
• Solution of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) + 1, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=44A294869
• a(n) = 3*a(n-1) - a(n-2) - 2*a(n-3) for n > 2, a(0)=1, a(1)=4, a(2)=10.at n=12A316528