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 A145103 #20 Dec 07 2022 16:38:40
%S A145103 1,1,1,2,6,12,10,5,4,7,16,23,16,9,8,13,25,31,22,13,12,19,34,40,28,17,
%T A145103 16,25,43,49,34,21,20,31,52,58,40,25,24,37,61,66,45,29,28,43,70,75,51,
%U A145103 33,32,49,79,84,57,37,36,55,88,93,63,41,40,61,97,102,69,45,44,67,106,111
%N A145103 a(0) = a(1) = 1. a(n+1) = ceiling(n*a(n)/a(n-1)), for n >= 1.
%H A145103 <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (1,-1,1,-1,1,1,-1,1,-1,1,-1).
%F A145103 From _Robert Israel_, Dec 06 2022: (Start)
%F A145103 a(6*k) = 6*k+3 for k >= 7.
%F A145103 a(6*k+1) = 4*k+1.
%F A145103 a(6*k+2) = 4*k for k >= 1.
%F A145103 a(6*k+3) = 6*k+1 for k >= 1.
%F A145103 a(6*k+4) = 9*k+7 for k >= 1.
%F A145103 a(6*k+5) = 9*k+12 for k >= 6.
%F A145103 (End)
%p A145103 A[0]:= 1: A[1]:= 1:
%p A145103 for n from 1 to 99 do A[n+1]:= ceil(n*A[n]/A[n-1]) od:
%p A145103 seq(A[i],i=0..100); # _Robert Israel_, Dec 06 2022
%t A145103 nxt[{n_,a_,b_}]:={n+1,b,Ceiling[((n+1)b)/a]}; Join[{1},Transpose[ NestList[ nxt,{0,1,1},80]][[3]]] (* _Harvey P. Dale_, Mar 04 2013 *)
%o A145103 (PARI) print1(a=1, ",", b=1, ","); for(n=2, 71, print1(c=ceil((n-1)*b/a), ","); a=b; b=c) \\ _Klaus Brockhaus_, Oct 02 2008
%o A145103 (PARI) a(n)=if(n<37, return([1, 1, 1, 2, 6, 12, 10, 5, 4, 7, 16, 23, 16, 9, 8, 13, 25, 31, 22, 13, 12, 19, 34, 40, 28, 17, 16, 25, 43, 49, 34, 21, 20, 31, 52, 58, 40][n+1])); my(r=n%6,k=n\6); if(r==0, 6*k+3, r==1, 4*k+1, r==2, 4*k, r==3, 6*k+1, r==4, 9*k+7, 9*k+12) \\ _Charles R Greathouse IV_, Dec 07 2022
%Y A145103 Cf. A145102.
%K A145103 nonn,easy
%O A145103 0,4
%A A145103 _Leroy Quet_, Oct 01 2008
%E A145103 More terms from _Klaus Brockhaus_ and _R. J. Mathar_, Oct 02 2008