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 A095164 #9 Aug 08 2015 20:15:32
%S A095164 1,2,3,8,5,18,7,32,27,50,11,84,13,98,75,128,17,162,19,200,147,242,23,
%T A095164 312,125,338,243,392,29,510,31,512,363,578,245,684,37,722,507,920,41,
%U A095164 882,43,968,765,1058,47,1392,343,1250,867,1352,53,1458,605,1624,1083
%N A095164 Index of the first occurrence of n in A095163.
%C A095164 Is this the same as A075384? - _R. J. Mathar_, Oct 28 2008
%p A095164 A095163 := proc(nmax) local a,dvs,d,n; a := [1,2,3] ; for n from 4 to nmax do dvs := sort(convert(numtheory[divisors](n),list)) ; for d in dvs do if ListTools[Occurrences](d,a) < d then a := [op(a),d] ; break; fi; od: od: a ; end: A095164 := proc(n,a095163) local i ; for i from 1 to nops(a095163) do if op(i,a095163) = n then RETURN(i) ; fi; od: RETURN(-1) ; end: a095163 := A095163(3700) ; for n from 1 do a095 := A095164(n,a095163) ; if a095 < 0 then break; else printf("%d,",a095) ; fi; od: # _R. J. Mathar_, Oct 28 2008
%Y A095164 Cf. A095161, A095162, A095163, A095165.
%K A095164 nonn
%O A095164 1,2
%A A095164 _Amarnath Murthy_, Jun 01 2004
%E A095164 More terms from _Nadia Heninger_, Jul 07 2005
%E A095164 More terms from _R. J. Mathar_, Oct 28 2008