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 A277063 #18 Sep 03 2024 08:25:39
%S A277063 0,0,1,3,6,15,46,151,570,2376,10961,54941,297220,1720725,10602541,
%T A277063 69176095,475881437,3439093081,26026621617,205694058211,1693554793730,
%U A277063 14494778231067,128711956613875,1183763037547762,11258075170582653,110558809039675629,1119649516271861536
%N A277063 Number of primes <= n-th Bell number.
%H A277063 Amiram Eldar, <a href="/A277063/b277063.txt">Table of n, a(n) for n = 0..28</a> (calculated using Kim Walisch's primecount)
%H A277063 Kim Walisch, <a href="https://github.com/kimwalisch/primecount">Fast C++ prime counting function implementation (primecount)</a>.
%F A277063 a(n) = A000720(A000110(n)). - _Michel Marcus_, Nov 10 2016
%t A277063 Table[PrimePi[BellB[n]], {n, 0, 20}]
%o A277063 (Magma) [#PrimesUpTo(Bell(n)): n in [0..14]];
%Y A277063 Cf. A000110, A000720, A054782, A277062.
%K A277063 nonn
%O A277063 0,4
%A A277063 _Vincenzo Librandi_, Nov 10 2016
%E A277063 a(21)-a(26) from _Charles R Greathouse IV_, Nov 10 2016