|
%I #6 Sep 04 2022 22:39:41
%S 3,15,58,156,339,643,1110,1788,2731,3999,5658,7780,10443,13731,17734,
%T 22548,28275,35023,42906,52044,62563,74595,88278,103756,121179,140703,
%U 162490,186708,213531,243139,275718,311460,350563,393231,439674,490108,544755,603843,667606,736284,810123
%N Number of nodes in graph BC(n,2) when the internal nodes are counted with multiplicity.
%C This graph BC(n,2) is also called SC(n,2) in earlier sequences (e.g. A331452). Once the Blomberg et al. paper is accepted for publication we will change the name from SC to BC.
%H Lars Blomberg, Scott R. Shannon, N. J. A. Sloane, <a href="http://neilsloane.com/doc/rose_5.pdf">Graphical Enumeration and Stained Glass Windows, 1: Rectangular Grids</a>, (2020). Also arXiv:2009.07918. See Eq. (7.2).
%F a(n) = (n^4+10*n^3+25*n^2+12*n+12)/4.
%t Table[(n^4 + 10*n^3 + 25*n^2 + 12*n + 12)/4, {n, 0, 50}] (* _Wesley Ivan Hurt_, Sep 04 2022 *)
%Y Cf. A331452.
%K nonn
%O 0,1
%A _N. J. A. Sloane_, May 20 2021
|
