login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057348 Days in months in the Islamic calendar starting from Muharram, 1 AH. The twelfth month has 30 days in a leap year. 5
30, 29, 30, 29, 30, 29, 30, 29, 30, 29, 30, 29, 30, 29, 30, 29, 30, 29, 30, 29, 30, 29, 30, 30, 30, 29, 30, 29, 30, 29, 30, 29, 30, 29, 30, 29, 30, 29, 30, 29, 30, 29, 30, 29, 30, 29, 30, 29, 30, 29, 30, 29, 30, 29, 30, 29, 30, 29, 30, 30, 30, 29, 30, 29, 30, 29, 30, 29, 30 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The months' names are Muharram, Safar, Rabi I, Rabi II, Jumada I, Jumada II, Rajab, Shaban, Ramadan, Shawwal, Dhu al-Qada, Dhu al-Hijja. The year, 354 11/30 days long, is defined as 12 lunar months and so travels around the solar year.
Periodic with period 360; the average month length is 29 + 191/360 = 29.530555... days. This is about 0.000032425 days shorter than the synodic month. - Charles R Greathouse IV, Mar 28 2016
Worldwide, five different Islamic leap-year cycles are currently in use; the month lengths a(n) correspond to the most common leap-year sequence (called "Fazari"). See A350539. - Robert B Fowler, Dec 07 2022
REFERENCES
N. Dershowitz and E. M. Reingold, Calendrical Calculations, Cambridge University Press, 1997.
LINKS
E. G. Richards, Collected algorithms from Mapping Time. The Calendar and its History, Oxford University Press 1999, (with corrections).
FORMULA
From Robert B Fowler, Dec 07 2022: (Start)
y = floor((n-1)/12) + 1 (Islamic year number)
m = ((n-1) mod 12) + 1 (Islamic month number)
a(n) = 29 + (m mod 2) + floor(m/12)*(floor((11*(y+1)+3)/30) - floor((11*y+3)/30)). (End)
MAPLE
isIslamicLeapYear := year -> irem(11 * year + 14, 30) < 11:
LastDayOfIslamicMonth := (year, month) -> if irem(month, 2) = 1 or (month = 12 and isIslamicLeapYear(year)) then 30 else 29 fi:
seq(seq(LastDayOfIslamicMonth(year, month), month=1..12), year = 1..5);
# Peter Luschny, Jan 07 2022
MATHEMATICA
If[Mod[n, 2]==1, 30, If[Mod[n, 12]!=0, 29, If[Mod[14+11(Floor[(n-1)/12]+1), 30]<11, 30, 29]]]
PROG
(PARI) a(n)=if(n%2, 30, n%12, 29, (n/12*11+14)%30<11, 30, 29) \\ Charles R Greathouse IV, Mar 28 2016
CROSSREFS
Sequence in context: A023472 A327846 A056998 * A057350 A244948 A282130
KEYWORD
nonn,easy
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 19:24 EDT 2024. Contains 371962 sequences. (Running on oeis4.)