Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A050190
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A050190
%S A050190 0,6,21,56,126,250,462,792,1287,2002,3000,4368,6188,8568,11628,15500,
%T A050190 20349,26334,33649,42504,53125,65780,80730,98280,118755,142500,169911,
%U A050190 201376,237336,278256,324625,376992,435897,501942
%N A050190 T(n,5), array T as in A050186; a count of aperiodic binary words.
%F A050190 G.f.: x^6(x^9-x^5-4x^4-15x^3+20x^2-15x+6)/[(1-x)^6(1-x^5)^2]. a(n) = 
               A000389(n) - [5 divides n]*n/5 = n*floor(C(n-1, 4)/5). - R. Stephan, 
               Aug 18 2004
%Y A050190 Equals n*A051170(n).
%Y A050190 Sequence in context: A002817 A132366 A015641 this_sequence A008498 A015640 
               A138780
%Y A050190 Adjacent sequences: A050187 A050188 A050189 this_sequence A050191 A050192 
               A050193
%K A050190 nonn
%O A050190 5,2
%A A050190 Clark Kimberling (ck6(AT)evansville.edu)
%E A050190 More terms from R. Stephan, Aug 18 2004

    
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 5 23:38 EST 2009. Contains 170428 sequences.


AT&T Labs Research