This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A039965 An example of a d-perfect sequence. 1
 1, 2, 2, 1, 2, 0, 0, 0, 2, 1, 2, 2, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 2, 2, 1, 2, 0, 0, 0, 2, 1, 2, 2, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 2, 2, 1, 2, 0, 0, 0, 2, 1, 2, 2, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS D. Kohel, S. Ling and C. Xing, Explicit Sequence Expansions, in Sequences and their Applications, C. Ding, T. Helleseth, and H. Niederreiter, eds., Proceedings of SETA'98 (Singapore, 1998), 308-317, 1999. FORMULA a(n) = ((-1)^(n+1)*A000108(n-1)) mod 3 - Christian G. Bower, Jun 12 2005 PROG (PARI) C(n) = binomial(2*n, n)/(n+1); a(n) = ((-1)^(n+1)*C(n-1)) % 3; \\ Michel Marcus, Jul 09 2016 CROSSREFS Cf. A000108. Sequence in context: A016739 A158452 A208929 * A300481 A074942 A043754 Adjacent sequences:  A039962 A039963 A039964 * A039966 A039967 A039968 KEYWORD nonn AUTHOR EXTENSIONS More terms from Christian G. Bower, Jun 12 2005 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 January 17 05:26 EST 2019. Contains 319207 sequences. (Running on oeis4.)