Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #3 Dec 05 2013 19:55:34
%S 1,5,6,9,12,15,17,21,23,26,28,31,34,37,39,42,45,48,50,53,56,58,61,64,
%T 66,70,72,74,78,80,83,86,88,91,94,96,99,102,105,107,110,113,116,118,
%U 121,124,126,129,132,134,138,140,142,146,148,151,153,157,159,161,165
%N a(1) = 1, for n > 1 a(n) is the smallest number such that the product of all previous terms is > n^n.
%o (PARI)v=vector(100):v[1]=1:print1("1,"):for(k=2,100,p=1:for(l=1,k-1,p=p*v[l]):print1(v[k]=ceil((k^k+1)/p)","))
%Y Cf. A074186.
%K nonn
%O 1,2
%A _Amarnath Murthy_, Aug 31 2002
%E More terms from _Ralf Stephan_, Mar 20 2003