This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A098385 #20 Mar 28 2021 01:11:47 %S A098385 13,44,132,368,976,2496,6208,15104,36096,84992,197632,454656,1036288, %T A098385 2342912,5259264,11730944,26017792,57409536,126091264,275775488, %U A098385 600834048,1304428544,2822766592,6090129408,13103005696,28118614016,60196651008 %N A098385 Ordered factorizations over hook-type prime signatures with exactly three distinct primes (third column of A098348). %C A098385 a(n) can also be calculated by transforming (3,18,8) applying the binomial transform twice. Cf. A098384. %H A098385 James Rayman, <a href="/A098385/b098385.txt">Table of n, a(n) for n = 0..2000</a> %F A098385 a(n) = 2^n * (n^2 + 8*n + 13). - _James Rayman_, Mar 27 2021 %e A098385 The hook-type least prime signatures with exactly three primes begin 30,60,120,...; therefore sequence begins A002033(30,60,120,...) = 13,44,132,... %o A098385 (Python) def a(n): return 2**n * (n**2 + 8*n + 13) # _James Rayman_, Mar 27 2021 %Y A098385 Cf. A002033, A098348, A098384. %K A098385 easy,nonn %O A098385 0,1 %A A098385 _Alford Arnold_, Sep 06 2004 %E A098385 More terms from _James Rayman_, Mar 27 2021