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!)
A113048 Binomial(4n,n)/(3n+1) mod 4. 1
1, 1, 0, 2, 0, 1, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0, 0, 0, 0, 0, 0, 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, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
It would appear that the behavior of this sequence is determined by values of the Jacobsthal numbers J(n)=A001045(n): a(n)=1 only if n=J(2k),k=0,1,...; a(n)=2 only if n=J(2k+3)+2J(2j), some k,j>=0, otherwise a(n)=0.
LINKS
MATHEMATICA
Table[Mod[Binomial[4n, n]/(3n+1), 4], {n, 0, 120}] (* Harvey P. Dale, Mar 18 2018 *)
CROSSREFS
Sequence in context: A252370 A045827 A070103 * A331671 A123758 A231642
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Oct 11 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)