Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051641
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A051641
%S A051641 3,6,55,66,171,252,595,666,969,1001,1771,2002,3003,3003,3003,5005,5995,
%T A051641 8008,8778,15051,66066,617716,646646,828828,1269621,1680861,3262623,
%U A051641 3544453,5073705,5676765,6295926,6378736,35133153,61477416,178727871
%N A051641 Palindromic binomial coefficients C(n,k) for k >= 2.
%D A051641 Alfred S. Posamentier & Ingmar Lehmann, The (Fabulous) Fibonacci Numbers, 
               Prometheus Books, NY, 2007, page 93.
%e A051641 C(10,5)=252. 3003 occurs thrice because C(14,6)=C(15,5)=C(78,2)=3003.
%t A051641 fQ[n_] := Block[{id = IntegerDigits@n}, id == Reverse@id]; lst = {}; 
               Do[ k = 2; While[k < n/2 + 1, b = Binomial[n, k]; If[fQ@b, AppendTo[lst, 
               b]; Print@b]; k++ ], {n, 25000000}]; Take[ Union@ lst, 35] - Robert 
               G. Wilson v
%Y A051641 Cf. A002113, A006987.
%Y A051641 Sequence in context: A132474 A032070 A066569 this_sequence A003098 A045914 
               A067610
%Y A051641 Adjacent sequences: A051638 A051639 A051640 this_sequence A051642 A051643 
               A051644
%K A051641 nonn,base,nice,easy
%O A051641 1,1
%A A051641 Joe DeMaio (jdemaio(AT)kennesaw.edu)
%E A051641 More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 20 2000

    
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 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research