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.

Showing 1-2 of 2 results.

A203509 Row sums of triangle A178473.

Original entry on oeis.org

1, 2, 4, 548, 9420, 3852, 34864, 19084, 15296, 154560176, 7180221844, 887102780, 211332046788, 71893259484, 20454788424, 5986072942766808, 5988933869570752, 22285488224, 2756032824242080, 17677170921656, 679436626785756, 20936052371230100988
Offset: 0

Views

Author

Vladimir Shevelev and Peter J. C. Moses, Jan 02 2012

Keywords

Comments

Conjecture. If prime p==1 (mod 4), then a((p-1)/4)==2 (mod p); if prime p==3 (mod 4), then a((p-1)/2)==2 (mod p).

Crossrefs

Cf. A202941, A202917, A203269, A203278, A203484, A178473, A203498.

A203498 Row sums of triangle A203484.

Original entry on oeis.org

1, 2, 44, 12, 2316, 56, 86756, 7548, 2745504, 14216, 8303228, 27440, 26755926552, 17777912, 337554780656, 166149231952, 41032825702988, 10165065032, 19445273523788, 559223251080, 52853093762480872, 2217608618621076, 3130076262074284420, 9840817961344
Offset: 0

Views

Author

Vladimir Shevelev and Peter J. C. Moses, Jan 02 2012

Keywords

Comments

Conjecture. If prime p==1 (mod 3), then a((p-1)/3)==2 (mod p); if prime p==2 mod 3, then a((2*p-1)/3)==2 (mod p).

Crossrefs

Cf. A202941, A202917, A203269, A203278, A203484, A178473.
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

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