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.

A109642 a(n) = least composite m such that binomial(3m,m) mod m = 3^n.

Original entry on oeis.org

4, 15, 57, 765, 1025, 2097, 4947, 9189, 103599, 216927, 4346128, 1558269, 1977777, 208510373, 14493123, 493262541, 144228033
Offset: 1

Views

Author

Ryan Propper, Aug 05 2005

Keywords

Comments

Subsequence of A109641.

Crossrefs

Programs

  • Mathematica
    In[1]:= n = 1; Do[If[ !PrimeQ[k] && Mod[Binomial[3*k, k], k] == 3^n, Print[k]; n++ ], {k, 1, 10^4}]

Extensions

Edited by Max Alekseyev, Nov 03 2009
a(14)-a(17) from Chai Wah Wu, Jul 30 2025