100672

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(4) = 4.at n=17A049930
• a(n) = A055993(n) - A034444(A056627(n)).at n=43A056630
• a(n) = (n+1)*(n+2)^2*(n+3)^2*(n+4)*(3*n+5)/720.at n=9A107908
• Eigentriangle, row sums = A125275.at n=42A147294
• Irregular triangle read by rows: T(n,k), 2 <= n , 3 <= k <= largest k such that A067175(k) <= n , is the smallest n-digit number m such that omega(m) = A001221(m) = k, and its largest prime factor equals the sum of its remaining prime factors. or -1 if no such number exists.at n=10A383677
• Irregular triangle T(n,k), n >= 0, 0 <= k < 2^(n-1), where T(n,k) = Product_{j=0..n-1} prime(n-j)^((j+1)*d_j), where d_j is the bit with digit weight 2^j in the binary expansion of 2^(n-1)+k.at n=35A387465