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 A376313 #18 Oct 21 2024 14:34:45 %S A376313 2,3,6,7,12,14,20,22,30,33,42,45,56,60,72,76,90,95,110,115,132,138, %T A376313 156,162,182,189,210,217,240,248,272,280,306,315,342,351,380,390,420, %U A376313 430,462,473,506,517,552,564,600,612,650,663,702,715,756,770,812,826,870,885,930,945,992,1008 %N A376313 Independence number of the 2-supertoken graph FF_2(C_n) of the cycle C_n on n vertices. %C A376313 Given a graph G on n vertices and an integer k>=1, the k-supertoken (or reduced k-th power) FF_k(G) of G has vertices representing configurations of k indistinguishable tokens in the (not necessarily different) vertices of G, with two configurations being adjacent if one can be obtained from the other by moving one token along an edge of G. %H A376313 R. H. Hammack and G. D. Smith, <a href="https://doi.org/10.26493/1855-3974.856.4d2">Cycle bases of reduced powers of graphs</a>, Ars Math. Contemp. 12 (2017) 183-203. %F A376313 a(n) = k*(n+2) if n=4*k or n=4*k+1, and a(n)=(k+1)*n if n=4*k+2 or n=4*k+3. %K A376313 nonn,easy %O A376313 2,1 %A A376313 _Miquel A. Fiol_, Sep 26 2024