login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081868 Numbers n such that sum(k=1,n,C(2k,k) mod 3) is even. 1
1, 2, 3, 10, 11, 28, 29, 36, 37, 38, 39, 82, 83, 90, 91, 92, 93, 108, 109, 110, 111, 118, 119, 244, 245, 252, 253, 254, 255, 270, 271, 272, 273, 280, 281, 324, 325, 326, 327, 334, 335, 352, 353, 360, 361, 362, 363, 730, 731, 738, 739, 740, 741, 756, 757, 758 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Robert Israel, Table of n, a(n) for n = 1..10000

MAPLE

  N:= 10000: # to get all terms <= N

alpha:= 2:

beta:= 0:

t:= 0:

A[1]:= 1:

count:= 1:

for i from 2 to N do

  d:= padic:-ordp(4 - 2/i, 3);

  beta:= beta + d;

  alpha:= alpha * (4-2/i)/3^d mod 3;

  if beta = 0 then

     t:= t + alpha mod 2;

  fi;

  if t = 0 then

     count:= count+1;

     A[count]:= i;

  fi

od:

seq(A[i], i=1..count); # Robert Israel, May 05 2014

PROG

(PARI) isok(n) = ! (sum(k=1, n, binomial(2*k, k) % 3) % 2); \\ Michel Marcus, Dec 04 2013

CROSSREFS

Sequence in context: A248407 A047473 A008509 * A212103 A193652 A092986

Adjacent sequences:  A081865 A081866 A081867 * A081869 A081870 A081871

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Apr 12 2003

EXTENSIONS

More terms from Michel Marcus, Dec 04 2013

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified November 27 20:25 EST 2014. Contains 250271 sequences.