cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A092428 Numbers n such that A092255(n) == 2 (mod 3).

Original entry on oeis.org

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

Views

Author

Benoit Cloitre, Mar 22 2004

Keywords

Programs

  • PARI
    for(n=1,775,if(binomial(2*n,n)%3*abs(gcd(3^50,n)-n)>0,print1(n,",")))

Formula

A092255(n) == 2 (mod 3) iff n is not a power of 3 or n is not in A074940