Search: id:A138621
Results 1-1 of 1 results found.

%I A138621
%S A138621 2,6,15,28,44,65,85,114,138,174,217,259,328,387,470,530,590,671,804,923,
%T A138621 1022,1106,1245,1335,1455,1616,1751,1926,2071,2260,2413,2620,2877,3058,
%U A138621 3278,3473,3768,4075,4342,4671,5012,5249,5539,5790,6107,6368,6752,7136
%N A138621 a(1)=2. For n >=2, a(n) = p(n) *(floor(a(n-1)/p(n)) +2), where p(n) is 
               the nth prime.
%C A138621 a(n) is the next-to-least multiple of the nth prime that is > a(n-1).
%C A138621 If we instead had the sequence where a(1)=2 and where a(n) is the least 
               multiple of the nth prime that is > a(n-1), then a(n) would equal 
               the nth prime for all positive integers n.
%H A138621 Leroy Quet, <a href="http://www.prism-of-spirals.net/">Home Page</a> 
               (listed in lieu of email address)
%p A138621 A138621 := proc(n) option remember ; local a ; if n = 1 then RETURN(2) 
               ; fi ; p := ithprime(n) ; p*(floor(A138621(n-1)/p)+2) ; end: seq(A138621(n),
               n=1..80) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 20 
               2008
%t A138621 a = {2}; Do[AppendTo[a, Prime[n]*(Floor[a[[ -1]]/Prime[n]] + 2)], {n, 
               2, 60}]; a - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), 
               May 18 2008
%Y A138621 Sequence in context: A033298 A153274 A091766 this_sequence A163061 A033286 
               A098651
%Y A138621 Adjacent sequences: A138618 A138619 A138620 this_sequence A138622 A138623 
               A138624
%K A138621 nonn
%O A138621 1,1
%A A138621 Leroy Quet May 14 2008
%E A138621 More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com) 
               and R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 18 2008

Search completed in 0.001 seconds