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 A195308 #39 Jul 21 2025 08:56:23 %S A195308 1,1,1,2,3,5,7,11,15,22,30,43,58,81,109,150,200,271,359,481,633,838, %T A195308 1095,1438,1867,2430,3136,4053,5200,6676,8519,10871,13802,17514,22129, %U A195308 27940,35141,44155,55299,69179,86286,107495,133562,165744,205188,253691,312975,385619 %N A195308 a(n) = A005291(n) + A005291(n+1). %C A195308 This sequence arises from A005291 in the same way as A000041 arises from A182712. %C A195308 Observation: a(3)..a(13) coincide with a sequence related to Stirling's numbers from the Jordan's book. %D A195308 Charles Jordan, Calculus of finite differences, Chelsea Publishing Co., 1965, chapter IV, pp. 153-155. %F A195308 a(n) = A000041(n-2), 2 <= n <= 11. - _Omar E. Pol_, Feb 24 2013 %Y A195308 Cf. A000041, A005291, A087787, A100818, A182712, A194439, A195017. %K A195308 nonn %O A195308 1,4 %A A195308 _Omar E. Pol_, Feb 03 2012 %E A195308 More terms from _Amiram Eldar_, May 17 2025