Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,2

COMMENT

Also the digital root of 8^n. Also the decimal expansion of 2/11. - Cino Hilliard (hillcino368(AT)gmail.com), Dec 31 2004

FORMULA

G.f. : (1+8x)/((1-x)(1+x)); a(n)=(9-7(-1)^n)/2; a(n)=8^(ceiling(n/2)-floor(n/2)); a(n)=gcd((n-1)^3, (n+1)^3). - Paul Barry (pbarry(AT)wit.ie), Sep 16 2004

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

CROSSREFS

Sequence in context: A154460 A021554 A021059 this_sequence A070637 A070651 A010519

Adjacent sequences: A010686 A010687 A010688 this_sequence A010690 A010691 A010692

KEYWORD

nonn

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research