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.
%I A155730 #34 Feb 16 2025 08:33:09 %S A155730 3,4,8,10,11,15,28,35,43,45,46,50,56,57,61,64,70,72,78,81,91,107,109, %T A155730 119,126,128,135,141,147,149,158,170,179,181,187,193,208,210,220,221, %U A155730 223,225,236,245,254,257,263,264,268,275,276,280,286,288,297,298,300 %N A155730 Indices of Bell numbers that are divisible by 5. %C A155730 First differences of terms of this sequence has a period of 156: a(156*m + n) - a(156*m + n -1) = a(156*s + n)- a(156*s + n - 1) for m and s >= 0. - _Enrique Pérez Herrero_, Oct 01 2013 %H A155730 Vaclav Kotesovec, <a href="/A155730/b155730.txt">Table of n, a(n) for n = 1..9990</a> (terms 1..1000 from Enrique Pérez Herrero). %H A155730 J. Levine and R. E. Dalton, <a href="https://doi.org/10.1090/S0025-5718-1962-0148604-2">Minimum Periods, Modulo p, of First Order Bell Exponential Integrals</a>, Mathematics of Computation, 16 (1962), 416-423. %H A155730 Samuel S. Wagstaff Jr., <a href="http://www.ams.org/mcom/1996-65-213/S0025-5718-96-00683-7/home.html">Aurifeuillian factorizations and the period of the Bell numbers modulo a prime</a>, Math. Comp. 65 (1996), 383-391. %H A155730 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BellNumber.html">Bell Number</a> %t A155730 Select[Range[300], Mod[BellB[#], 5] == 0 &] (* _T. D. Noe_, Oct 01 2013 *) %Y A155730 Cf. A000110, A229004, A054767, A016789. %K A155730 nonn %O A155730 1,1 %A A155730 _David Pasino_, Jan 25 2009