The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A158515 Number of colors needed to paint a wheel graph on n nodes. 3
 0, 1, 2, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Adjacent nodes are not allowed to have the same color. LINKS Antti Karttunen, Table of n, a(n) for n = 0..1001 Eric Weisstein's World of Mathematics, Wheel graph Wikipedia, Wheel graph FORMULA G.f.: x*(1+2*x+2*x^2+2*x^3)/(1-x^2) PROG (PARI) a(n)=if(n<4, n, 4-n%2) (Scheme) (define (A158515 n) (if (< n 4) n (- 4 (modulo n 2)))) ;; Antti Karttunen, Sep 14 2017 CROSSREFS Cf. A158411, A158478. Sequence in context: A139048 A182101 A242289 * A285884 A123709 A165482 Adjacent sequences:  A158512 A158513 A158514 * A158516 A158517 A158518 KEYWORD nonn AUTHOR Jaume Oliver Lafont, Mar 20 2009 STATUS approved

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

Last modified May 18 14:11 EDT 2021. Contains 343995 sequences. (Running on oeis4.)