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 #11 Aug 05 2013 17:32:52
%S 1,2,3,5,7,8,12,17,19,29,41,46,70,99,111,169,239,268,408,577,647,985,
%T 1393,1562,2378,3363,3771,5741,8119,9104,13860,19601,21979,33461,
%U 47321,53062,80782,114243,128103,195025,275807,309268,470832,665857,746639
%N a(n) is the n-th new record value in A073300.
%H Nathaniel Johnston, <a href="/A073301/b073301.txt">Table of n, a(n) for n = 1..2500</a>
%F For n>=7, a(3n)=a(3n-2)+a(3n-4), a(3n+1)=a(3n-1)+a(3n-2) and a(3n+2)=a(3n+1)+a(3n-2). - _R. J. Mathar_, Jun 27 2007
%p A073301 := proc(n) option remember: local f6: f6:=[1,2,3,5,7,8]: if(n<=6)then return f6[n]: elif(n mod 3 = 0)then return procname(n-2)+procname(n-4): elif(n mod 3 = 1)then return procname(n-2)+procname(n-3): else return procname(n-1)+procname(n-4): fi: end: seq(A073301(n),n=1..50); # _Nathaniel Johnston_, May 01 2011
%Y Cf. A073300, A072347.
%K base,nonn,easy
%O 1,2
%A _John W. Layman_, Jul 23 2002
%E Corrected by _T. D. Noe_, Oct 25 2006