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 A109736 #30 Jul 02 2025 11:31:37
%S A109736 1,2,3,5,9,4,23,6,8,10,40,7,22,30,11,15,67,19,49,13,38,42,43,14,12,56,
%T A109736 21,46,48,18,58,16,41,68,37,20,89,57,60,55,76,63,151,78,107,96,98,17,
%U A109736 61,65,69,71,24,103,87,64,80,74,44,83,59,92,101,94,72,91,185,142,104,45
%N A109736 Where n appears in A109890.
%C A109736 a(10^n): 1, 10, 128, 1430, ... - _Robert G. Wilson v_, Aug 12 2005
%C A109736 a(n) = A094341(n) for 3 <= n <= 70. - _Georg Fischer_, Nov 02 2018
%C A109736 According to the remarks in A109890, A094339 and A109890 are essentially the same, just swapping the first 2 terms, so this here is a(n)=A094341(n) for n>=3. - _R. J. Mathar_, Jul 02 2025
%H A109736 Richard J. Mathar and Reinhard Zumkeller, <a href="/A109736/b109736.txt">Table of n, a(n) for n = 1..10000</a> (first 282 terms from Richard J. Mathar)
%t A109736 a[1] = 1; a[2] = 2; a[n_] := a[n] = Block[{t = Table[a[i], {i, n - 1}]}, s = Plus @@ t; d = Divisors[s]; l = Complement[d, t]; If[l != {}, k = First[l], k = s; While[Position[t, k] == {}, k += s]; k]]; t = Table[a[n], {n, 250}]; Table[k = 1; While[ t[[k]] != n, k++ ]; k, {n, 70}] (* _Robert G. Wilson v_, Aug 12 2005 *)
%o A109736 (Haskell)
%o A109736 import Data.List (elemIndex); import Data.Maybe (fromJust)
%o A109736 a109736 = (+ 1) . fromJust . (`elemIndex` a109890_list)
%o A109736 -- _Reinhard Zumkeller_, Jan 01 2015
%Y A109736 Cf. A094341, A095259, A109890.
%K A109736 nonn
%O A109736 1,2
%A A109736 _N. J. A. Sloane_ and _Nadia Heninger_, Aug 11 2005
%E A109736 More terms from _Robert G. Wilson v_, Aug 12 2005