|
%I M4961 N2127
%S 1,15,29,12,26,12,26,9,23,7,21,4,18,2,16,30,13,27,10,24,8,22,5,19,3,
%T 17,31,14,28,11,25,11,25,8,22,6,20,3,17,1,15,29,12,26,9,23,7,21,4,18,
%U 2,16,30,13,27,10,24,10,24,7,21,5,19,2,16,30,14,28,11,25,8,22,6,20,3,17,1,15
%N Dates at fortnightly intervals from Jan 01.
%C Sequence assumes that the first year is the year after a leap year.
%D Archimedeans Problems Drive, Eureka, 13 (1950), 11.
%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H <a href="/index/Ca#calendar">Index entries for sequences related to calendars</a>
%t (* first do *) Needs["Calendar`"] (* then *) Table[ DaysPlus[{1, 1, 1}, 14 n][[3]], {n, 0, 77}] [From _Robert G. Wilson v_, Apr 18 2010]
%Y Cf. A051121.
%K nonn,easy,nice
%O 1,2
%A _N. J. A. Sloane_.
%E More terms from Larry Reeves (larryr(AT)acm.org), Mar 17 2000
%E One more term from _Robert G. Wilson v_, Apr 18 2010
|
