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!)
A307702 Clique covering number of the n-Sierpinski tetrahedron graph. 1
1, 4, 11, 41, 161, 641, 2561, 10241, 40961, 163841, 655361, 2621441, 10485761, 41943041, 167772161, 671088641, 2684354561, 10737418241, 42949672961, 171798691841, 687194767361, 2748779069441, 10995116277761, 43980465111041, 175921860444161, 703687441776641 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Eric Weisstein's World of Mathematics, Clique Covering Number
Eric Weisstein's World of Mathematics, Sierpinski Tetrahedron Graph
FORMULA
a(n) = A199209(n-2) = 10*4^(n-3) for n >= 3.
From Colin Barker, Jul 20 2019: (Start)
G.f.: x*(1 + 2*x)*(1 - 3*x + x^2) / ((1 - x)*(1 - 4*x)).
a(n) = 5*a(n-1) - 4*a(n-2) for n>4.
(End)
PROG
(PARI) Vec(x*(1 + 2*x)*(1 - 3*x + x^2) / ((1 - x)*(1 - 4*x)) + O(x^30)) \\ Colin Barker, Jul 20 2019
CROSSREFS
Cf. A199209.
Sequence in context: A149269 A149270 A306188 * A214167 A278988 A214188
KEYWORD
nonn,easy
AUTHOR
Eric W. Weisstein, Apr 22 2019
EXTENSIONS
More terms from Colin Barker, Jul 20 2019
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 March 28 16:58 EDT 2024. Contains 371254 sequences. (Running on oeis4.)