This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A014306 a(n) = 0 if n of form m(m+1)(m+2)/6, otherwise 1. 38
 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS a(A145397(n))=1; a(A000292(n))=0; a(n)=1-A023533(n). - Reinhard Zumkeller, Oct 14 2008 Characteristic function of A145397. LINKS Antti Karttunen, Table of n, a(n) for n = 0..65537 EXAMPLE From David A. Corneth, Oct 01 2018: (Start) For n = 0, floor((6*0-1) ^ (1/3)) = -1. binomial(-1 + 2, 3) = n so a(0) = 0. For n = 10, floor((6*n-1) ^ (1/3)) = 3. binomial(3 + 2, 3) = n so a(10) = 0. For n = 11, floor((6*n-1) ^ (1/3)) = 3. binomial(3 + 2, 3) != n so a(11) = 1. (End) PROG (PARI) A014306(n) = { my(k=0); while(binomial(k+2, 3)

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

Last modified October 23 22:04 EDT 2018. Contains 316541 sequences. (Running on oeis4.)