96641

Appears in sequences

• Number of unlabeled connected loop-less graphs on n nodes containing exactly one cycle (of length at least 2) and with all nodes of degree <= 4.at n=14A002094
• Strong pseudoprimes to base 26.at n=26A020252
• Strong pseudoprimes to base 33.at n=21A020259
• Strong pseudoprimes to base 76.at n=35A020302
• Expansion of e.g.f. 1/(exp(x)-x*exp(2*x)).at n=7A092148
• Number of n X 3 0..1 arrays with every element equal to 0, 1 or 3 horizontally or vertically adjacent elements, with upper left element zero.at n=12A301536