login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051641 Palindromic binomial coefficients C(n,k) for k >= 2. 1
3, 6, 55, 66, 171, 252, 595, 666, 969, 1001, 1771, 2002, 3003, 3003, 3003, 5005, 5995, 8008, 8778, 15051, 66066, 617716, 646646, 828828, 1269621, 1680861, 3262623, 3544453, 5073705, 5676765, 6295926, 6378736, 35133153, 61477416, 178727871 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

REFERENCES

Alfred S. Posamentier & Ingmar Lehmann, The (Fabulous) Fibonacci Numbers, Prometheus Books, NY, 2007, page 93.

LINKS

Table of n, a(n) for n=1..35.

EXAMPLE

C(10,5)=252. 3003 occurs thrice because C(14,6)=C(15,5)=C(78,2)=3003.

MATHEMATICA

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 *)

CROSSREFS

Cf. A002113, A006987, A104182.

Sequence in context: A132474 A032070 A066569 * A003098 A045914 A303351

Adjacent sequences:  A051638 A051639 A051640 * A051642 A051643 A051644

KEYWORD

nonn,base,nice,easy

AUTHOR

Joe DeMaio (jdemaio(AT)kennesaw.edu)

EXTENSIONS

More terms from Robert G. Wilson v, Aug 20 2000

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 14 15:01 EST 2019. Contains 329979 sequences. (Running on oeis4.)