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 A290511 #10 Feb 16 2025 08:33:49 %S A290511 3,9,24,77,198,522,1550,4477,12732,36214,103579,296294,846303,2417368, %T A290511 6907329,19737901,56396602,161138214,460420182,1315565162,3758963099, %U A290511 10740463083,30688703123,87686813998,250547405698,715888629491,2045507376543,5844625043236 %N A290511 Number of irredundant sets in the n-prism graph. %C A290511 The n-prism graph is well defined for n >= 3. Sequence extended to n=1 via the number of period n periodic solutions on a larger graph. - _Andrew Howroyd_, Aug 07 2017 %H A290511 Andrew Howroyd, <a href="/A290511/b290511.txt">Table of n, a(n) for n = 1..200</a> %H A290511 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/IrredundantSet.html">Irredundant Set</a> %H A290511 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PrismGraph.html">Prism Graph</a> %F A290511 Empirical: a(n) = 3*a(n-1) - a(n-3) + 2*a(n-4) - 6*a(n-5) - 8*a(n-6) + 13*a(n-7) + 6*a(n-8) - 6*a(n-9) - 2*a(n-10) - 5*a(n-11) - 4*a(n-12) + 2*a(n-13) + 2*a(n-14) - a(n-15) + a(n-16) + 3*a(n-17) + 2*a(n-19) for n > 19. - _Andrew Howroyd_, Aug 07 2017 %Y A290511 Cf. A284702, A290336, A290493. %K A290511 nonn %O A290511 1,1 %A A290511 _Eric W. Weisstein_, Aug 04 2017 %E A290511 a(1)-a(2) and terms a(10) and beyond from _Andrew Howroyd_, Aug 07 2017