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 A134715 #30 Nov 04 2024 05:16:17
%S A134715 1,1,5,15,203,877,21147,115975,4213597,27644437,1382958545,
%T A134715 10480142147,682076806159,5832742205057,474869816156751,
%U A134715 4506715738447323,445958869294805289,4638590332229999353,545717047936059989389,6160539404599934652455,846749014511809332450147,10293358946226376485095653
%N A134715 Odd Bell numbers.
%C A134715 A000110 except A121293. - _Vladimir Reshetnikov_, Nov 02 2015
%H A134715 G. C. Greubel, <a href="/A134715/b134715.txt">Table of n, a(n) for n = 1..203</a> [Invalid terms a(21) and a(102) removed by _Georg Fischer_, Nov 03 2024]
%F A134715 a(n) = A000110((6*n-7-(-1)^n)/4) = A000110(A032766(n-1)). - _Vladimir Reshetnikov_, Nov 05 2015
%p A134715 a := n -> combinat:-bell(n-1 + floor((n-1)/2)):
%p A134715 seq(a(n), n=1..18); # _Peter Luschny_, Nov 03 2015
%t A134715 Table[BellB[(6 n-7-(-1)^n)/4],{n,1,20}] (* _Vladimir Reshetnikov_, Nov 05 2015 *)
%o A134715 (PARI) a000110(n) = n!*polcoeff(exp(exp(x+x*O(x^n))-1), n);
%o A134715 for(n=0, 30, if(a000110(n)%2 == 1, print1(a000110(n) ", "))) \\ _Altug Alkan_, Nov 02 2015
%Y A134715 Cf. A000110, A121293.
%K A134715 easy,nonn
%O A134715 1,3
%A A134715 _Omar E. Pol_, Nov 11 2007
%E A134715 More terms from _Omar E. Pol_, Dec 10 2008