19722

Appears in sequences

• Numbers that are the sum of 3 nonzero 6th powers.at n=26A003359
• Number of distinct values produced from sums and products of n unity arguments.at n=29A048249
• Maximal value of Sum_{i=1..n} (p(i) - p(i+1))^2, where p(n+1) = p(1), as p ranges over all permutations of {1, 2, ..., n}.at n=38A064842
• a(n) = 1^n + 4^n + 5^n.at n=6A074511
• a(n) = n*(n^2+3*n-1)/3.at n=38A084990
• n*(n-1)*(n^2-n+4)/6.at n=19A103290
• Sum of distinct nonzero sixth powers.at n=24A194769
• Smallest sets of 7 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.at n=9A228964
• 30-gonal numbers: a(n) = n*(14*n-13).at n=38A254474
• Solution of the complementary equation a(n) = 3*a(n-1) + b(n-1) - n, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=9A295137
• Number of nX4 0..1 arrays with every element equal to 1, 2, 3, 5 or 8 king-move adjacent elements, with upper left element zero.at n=5A298766
• Number of nX6 0..1 arrays with every element equal to 1, 2, 3, 5 or 8 king-move adjacent elements, with upper left element zero.at n=3A298768
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 5 or 8 king-move adjacent elements, with upper left element zero.at n=39A298770
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 5 or 8 king-move adjacent elements, with upper left element zero.at n=41A298770
• Total number A(n,k) of k-tuples of semi-Dyck paths from (0,0) to (n,n-2*j) for j=0..floor(n/2); square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=71A357824
• a(n) = S(6,n), where S(r,n) = Sum_{k=0..floor(n/2)} ( binomial(n,k) - binomial(n,k-1) )^r.at n=5A382433
• a(n) = (smallest digit of n)^(largest digit of n) + n.at n=39A386253