Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A011765
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A011765 Period 4: repeat 0,0,0,1. +0
6
0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1 (list; graph; listen)
OFFSET

1,1

COMMENT

Arises in connection with leap years, years of U.S. Presidential elections, Olympic Games, etc.

Note that leap years define a sequence with period length 400, unlike A121262 which has period length 4. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 19 2008]

FORMULA

G.f.: x^4/(1-x^4). [From Mohammad K. Azarian (azarian(AT)evansville.edu), Dec 23 2008]

a(n)=(1/24)*{7*(n mod 4)-5*[(n+1) mod 4]+[(n+2) mod 4]+[(n+3) mod 4]}, with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Feb 06 2009]

CROSSREFS

A121262 is another version.

Sequence in context: A111900 A157228 A105563 this_sequence A129251 A144602 A160351

Adjacent sequences: A011762 A011763 A011764 this_sequence A011766 A011767 A011768

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 19:42 EST 2009. Contains 167435 sequences.


AT&T Labs Research