Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,2

FORMULA

Binomial transform is A084242. - Paul Barry (pbarry(AT)wit.ie), May 23 2003

a(n)=4-3(-1)^n; G.f.: (1+7x)/((1+x)(1-x)); E.g.f.: 4exp(x)-3exp(-x). - Paul Barry (pbarry(AT)wit.ie), May 23 2003

a(n)=7*(n mod 2)+(n+1) mod 2 - Paolo P. Lava (ppl(AT)spl.at), Oct 20 2006

CROSSREFS

Sequence in context: A019796 A132728 A083530 this_sequence A033953 A010772 A093564

Adjacent sequences: A010685 A010686 A010687 this_sequence A010689 A010690 A010691

KEYWORD

nonn

AUTHOR

njas

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 July 4 18:25 EDT 2008. Contains 140886 sequences.


AT&T Labs Research