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.

A066562 Smallest Bell number (A000110) divisible by n, if such a number exists, otherwise 0.

Original entry on oeis.org

1, 2, 15, 52, 5, 4140, 203, 0, 4140, 4140, 10293358946226376485095653, 4140, 52, 51724158235372, 15, 0, 4506715738447323, 4140, 21147, 4140, 21147, 1052928518014714166107781298021583534928402714242132, 4140, 0, 115975, 52, 82864869804, 51724158235372, 203, 4140
Offset: 1

Views

Author

Amarnath Murthy, Dec 17 2001

Keywords

Comments

No Bell number is divisible by 8. - John W. Layman, Jan 02 2002

Crossrefs

Programs

  • Mathematica
    b[ n_ ] := Nest[ Factor[ D[ #1, x ] ] &, Exp[ Exp[ x - 1 ] - 1 ], n ] /. (x -> 1); Do[ k = 1; While[ c = b[ k ]; !IntegerQ[ c/n ], k++ ]; Print[ c ], {n, 1, 7} ]

Extensions

More terms from John W. Layman, Jan 02 2002
More terms from David Wasserman, Mar 31 2008