login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A295926 Number of (not necessarily maximal) cliques in the n-cube-connected cycle graph. 0
69, 161, 401, 961, 2241, 5121, 11521, 25601, 56321, 122881, 266241, 573441, 1228801, 2621441, 5570561, 11796481, 24903681, 52428801, 110100481, 230686721, 482344961, 1006632961, 2097152001, 4362076161, 9059696641, 18790481921, 38923141121, 80530636801, 166429982721 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,1
LINKS
Eric Weisstein's World of Mathematics, Clique
Eric Weisstein's World of Mathematics, Cube-Connected Cycle Graph
FORMULA
a(n) = 5*2^(n - 1)*n + 1 for n > 3.
a(n) = 5*a(n-1) - 8*a(n-2) + 4*a(n-3) for n > 3.
G.f.: x^3*(-69 + 184*x - 148*x^2 + 32*x^3)/((-1 + x)*(-1 + 2*x)^2).
MATHEMATICA
Table[If[n == 3, 69, 5 2^(n - 1) n + 1], {n, 3, 20}]
Join[{69}, LinearRecurrence[{5, -8, 4}, {161, 401, 961}, 20]]
CoefficientList[Series[(-69 + 184 x - 148 x^2 + 32 x^3)/((-1 + x) (-1 + 2 x)^2), {x, 0, 20}], x]
CROSSREFS
Sequence in context: A063355 A044320 A044701 * A063322 A118215 A033672
KEYWORD
nonn
AUTHOR
Eric W. Weisstein, Nov 29 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 16:23 EDT 2024. Contains 371989 sequences. (Running on oeis4.)