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 A094341 #11 Oct 24 2023 03:21:50
%S A094341 2,1,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 A094341 21,46,48,18,58,16,41,68,37,20,89,57,60,55,76,63,151,78,107,96,98,17,
%U A094341 61,65,69,71,24,103,87,64,80,74,44,83,59,92,101,94,72,91,185,142,104,45
%N A094341 Index of the occurrence of n in A094339.
%p A094341 A094339 := proc(nmax) local a,n,sprev,i; a := [2] ; while nops(a) < nmax do sprev := add(i,i=a) ; n := 1 ; while sprev mod n <> 0 or n in a do n := n+1 ; od ; a := [op(a),n] ; od ; RETURN(a) ; end: a094339 := A094339(300) : n := 1 : while member(n,a094339,'w') do printf("%d, ",w) ; n := n+1 ; od : # _R. J. Mathar_, Apr 30 2007
%t A094341 nmax = 70; s = {2};
%t A094341 Do[AppendTo[s, Min[Select[Divisors[Total[s]], !MemberQ[s, #] &]]], {t, 2, 3 nmax}];
%t A094341 a[n_] := FirstPosition[s, n][[1]];
%t A094341 Table[a[n], {n, 1, nmax}] (* _Jean-François Alcover_, Oct 24 2023, after _Ivan Neretin_ in A094339 *)
%Y A094341 Cf. A094339, A094340.
%K A094341 nonn
%O A094341 1,1
%A A094341 _Amarnath Murthy_, May 17 2004
%E A094341 Corrected and extended by _R. J. Mathar_, Apr 30 2007