Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,2

FORMULA

G.f.:(1+4x)/((1-x)(1+x)); E.g.f.:(5exp(x)-3exp(-x))/2; a(n)=(5-3(-1)^n)/2; a(n)=4^((1-(-1)^n)/2)=2^(1-(-1)^n)=2/(2^((-1)^n)); a(n)=4^(ceiling(n/2)-floor(n/2)). - Paul Barry (pbarry(AT)wit.ie), Jun 03 2003

a(n)=gcd((n-1)^2, (n+1)^2) - Paul Barry (pbarry(AT)wit.ie), Sep 16 2004

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

MAPLE

[seq (modp((3*n+1), 6), n=0..80)]; - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 30 2006

CROSSREFS

Sequence in context: A030748 A096622 A080905 this_sequence A099301 A050347 A126114

Adjacent sequences: A010682 A010683 A010684 this_sequence A010686 A010687 A010688

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research