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 A089651 #23 Feb 24 2023 18:24:23 %S A089651 1,2,3,4,5,7,9,11,13,16,19,22,25,29,33,37,41,46,51,56,61,68,75,82,89, %T A089651 98,107,116,125,136,147,158,169,182,195,208,221,237,253,269,285,304, %U A089651 323,342,361,383,405,427,449,474,499,524,549,578,607,636,665,698,731 %N A089651 Partial sums of the sequence : a(1)=1, a(1), a(1), a(1), a(1), a(2), a(2), a(2), a(2), a(3), a(3), a(3), a(3), a(4), ... each term (not a(1)) repeated 4 times. %H A089651 Alois P. Heinz, <a href="/A089651/b089651.txt">Table of n, a(n) for n = 1..10000</a> %F A089651 a(n) = a(n-1) + a(floor((n+2)/4)) with a(1)=1. - _Alois P. Heinz_, Feb 24 2023 %p A089651 a:= proc(n) a(n):= `if`(n=1, 1, a(n-1)+a(iquo(n+2, 4))) end: %p A089651 seq(a(n), n=1..60); # _Alois P. Heinz_, Feb 24 2023 %Y A089651 Row k=4 of A089606. %K A089651 easy,nonn %O A089651 1,2 %A A089651 _Philippe Deléham_, Jan 02 2004