|
%I #14 Feb 11 2023 15:56:42
%S 6,2,3,6,1,4,6,2,5,0,3,5,1,4,4,0,2,5,0,3,6,1,4,6,2,5,5,1,3,6,1,4,0,2,
%T 5,0,3,6,6,2,4,0,2,5,1,3,6,1,4,0,1,4,6,2,4,0,3,5,1,3,6,2,2,5,0,3,5,1,
%U 4,6,2,4,0,3,3,6,1,4,6,2,5,0,3,5,1,4,4,0,2,5,0,3,6,1,4,6,2,5,6,2,4,0,2,5,1
%N Numbers representing the index of the day of week for the first day of the month in the Gregorian calendar.
%C The index is 0-based, so 0 = Sunday, 1 = Monday, 2 = Tuesday, 3 = Wednesday, 4 = Thursday, 5 = Friday, 6 = Saturday.
%C The first term in the sequence represents the day of the week index for January 1, A.D. 2000.
%C The sequence repeats after 4800 terms, representing 400 years in the Gregorian calendar system.
%D Arthur Benjamin and Michael Shermer, Secrets of Mental Math, First Edition, Three Rivers Press, 2006, p. 215.
%H Lyle P. Blosser, <a href="/A178054/b178054.txt">Table of n, a(n) for n = 1..4800</a>
%H <a href="/index/Ca#calendar">Index entries for sequences related to calendars</a>
%F a(n+1) = (a(n) + A178055(n)) (mod 7).
%e a(1) = 6, so day of week for January 1, 2000 is Saturday; a(2) = 2, so day of week for February 1, 2000 is Tuesday; a(3) = 3, so day of week for March 1, 2000 is Wednesday.
%Y Cf. A178055.
%K easy,nonn
%O 1,1
%A Lyle P. Blosser (lyleblosser(AT)att.net), May 18 2010
|
