OFFSET
0,2
COMMENTS
Burning number of the n-ladder (for n >= 1), n-Moebius ladder (for n >= 3), and n-prism (for n >= 3) graphs.
Except for the first term, n+1 appears 2n times for n>0. - Chai Wah Wu, Feb 11 2026
LINKS
Eric Weisstein's World of Mathematics, Burning Number.
Eric Weisstein's World of Mathematics, Ladder Graph.
Eric Weisstein's World of Mathematics, Moebius Ladder.
Eric Weisstein's World of Mathematics, Prism Graph.
FORMULA
a(n) = A000194(n) + 1. - Andrew Howroyd, Jan 10 2024
G.f.: x*(1 + QPochhammer(-x^2, x^4)*QPochhammer(x^8, x^8))/(1 - x).
MATHEMATICA
Table[Floor[3/2 + Sqrt[n]], {n, 50}]
Floor[3/2 + Sqrt[Range[50]]]
CoefficientList[Series[(1 + QPochhammer[-x^2, x^4] QPochhammer[x^8, x^8])/(1 - x), {x, 0, 50}], x]
PROG
(PARI) apply( {A368941(n)=sqrtint(4*n)\/2+1}, [0..99]) \\ M. F. Hasler, Nov 06 2025
(Python)
from math import isqrt
def A368941(n): return (m:=isqrt(n))+(n>m*(m+1))+1 # Chai Wah Wu, Feb 11 2026
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Eric W. Weisstein, Jan 10 2024
EXTENSIONS
Terms a(26) and beyond from Andrew Howroyd, Jan 10 2024
STATUS
approved
