84185
domain: N
Appears in sequences
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n-1 <= 2^(p+1), with a(1) = a(2) = 1.at n=19A049884
- Triangle read by rows: T(n,k) is the number of simple connected graphs on n vertices having independence number k.at n=50A294490