Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A010691
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A010691
%S A010691 1,10,1,10,1,10,1,10,1,10,1,10,1,10,1,10,1,10,1,10,1,10,
%T A010691 1,10,1,10,1,10,1,10,1,10,1,10,1,10,1,10,1,10,1,10,1,10,
%U A010691 1,10,1,10,1,10,1,10,1,10,1,10,1,10,1,10,1,10,1,10,1,10
%N A010691 Period 2.
%F A010691 a(n)=-9/2*(-1)^n+11/2 a(n)=10*(n mod 2)+(n+1) mod 2 - Paolo P. Lava (ppl(AT)spl.at), 
               Oct 20 2006
%F A010691 G.f.:(1+10*z)/((1-z^2)) . [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), 
               Feb 25 2009]
%p A010691 g:=(1+10*z)/((1-z^2)): gser:=series(g, z=0, 66): seq((coeff(gser, z, 
               n)), n=0..65);# [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), 
               Feb 25 2009]
%Y A010691 Sequence in context: A144261 A046148 A164915 this_sequence A143970 A093645 
               A130858
%Y A010691 Adjacent sequences: A010688 A010689 A010690 this_sequence A010692 A010693 
               A010694
%K A010691 nonn
%O A010691 0,2
%A A010691 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 December 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research