|
%I #25 Nov 03 2018 17:53:40
%S 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 21,46,48,18,58,16,41,68,37,20,89,57,60,55,76,63,151,78,107,96,98,17,
%U 61,65,69,71,24,103,87,64,80,74,44,83,59,92,101,94,72,91,185,142,104,45
%N Where n appears in A109890.
%C a(10^n): 1, 10, 128, 1430, ... - _Robert G. Wilson v_, Aug 12 2005
%C a(n) = A094341(n) for 3 <= n <= 70. - _Georg Fischer_, Nov 02 2018
%H 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 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 (Haskell)
%o import Data.List (elemIndex); import Data.Maybe (fromJust)
%o a109736 = (+ 1) . fromJust . (`elemIndex` a109890_list)
%o -- _Reinhard Zumkeller_, Jan 01 2015
%Y Cf. A094341, A095259.
%K nonn
%O 1,2
%A _N. J. A. Sloane_ and _Nadia Heninger_, Aug 11 2005
%E More terms from _Robert G. Wilson v_, Aug 12 2005
|
