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 A110737 #17 Jan 01 2021 12:50:58
%S A110737 1,4,21,40,1555,3906,299593,3280,87381,435848050,67546215517,61035156,
%T A110737 61054982558011,328114698808274,76861433640456465,21523360,
%U A110737 128583032925805678351,953674316406,275941052631578947368421,1743392200
%N A110737 Row sums in A112668.
%C A110737 For all n, a(n) is a term in row n of triangle A125118, and furthermore if n is prime then a(n) = A060072(n+1). - _Mathew Englander_, Dec 20 2020
%H A110737 Michael De Vlieger, <a href="/A110737/b110737.txt">Table of n, a(n) for n = 1..388</a>
%p A110737 A110737 := proc(n) local i,a ; if n = 1 then RETURN(1) ; else a := 2 ; while (1-a^n)/(1-a) mod n <> 0 do a := a+1 ; od ; RETURN( (1-a^n)/(1-a) ) ; fi ; end: for n from 1 to 25 do printf("%d, ",A110737(n)) : od : # _R. J. Mathar_, Mar 13 2007
%t A110737 Block[{a = {1}, k, s}, Do[k = 2; While[Mod[Set[s, Total@ NestList[# k &, 1, i - 1]], i] != 0, k++]; AppendTo[a, s], {i, 2, 20}]; a] (* _Michael De Vlieger_, Dec 31 2020 *)
%Y A110737 Cf. A110738, A110739, A125118, A060072.
%K A110737 easy,nonn
%O A110737 1,2
%A A110737 _Amarnath Murthy_, Aug 10 2005
%E A110737 More terms from _R. J. Mathar_, Mar 13 2007