login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A092428
Numbers n such that A092255(n) == 2 (mod 3).
1
4, 10, 12, 13, 28, 30, 31, 36, 37, 39, 40, 82, 84, 85, 90, 91, 93, 94, 108, 109, 111, 112, 117, 118, 120, 121, 244, 246, 247, 252, 253, 255, 256, 270, 271, 273, 274, 279, 280, 282, 283, 324, 325, 327, 328, 333, 334, 336, 337, 351, 352, 354, 355, 360, 361, 363
OFFSET
1,1
FORMULA
A092255(n) == 2 (mod 3) iff n is not a power of 3 or n is not in A074940
PROG
(PARI) for(n=1, 775, if(binomial(2*n, n)%3*abs(gcd(3^50, n)-n)>0, print1(n, ", ")))
CROSSREFS
Sequence in context: A078005 A370859 A355275 * A170943 A102998 A071179
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Mar 22 2004
STATUS
approved