Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128936
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128936 a(n)=binomial(n, sum_digits_n). +0
2
1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 55, 220, 715, 2002, 5005, 11440, 24310, 48620, 92378, 190, 1330, 7315, 33649, 134596, 480700, 1562275, 4686825, 13123110, 34597290, 4060, 31465, 201376, 1107568, 5379616, 23535820, 94143280, 348330136, 1203322288 (list; graph; listen)
OFFSET

1,10

EXAMPLE

a(12)=binom(12,3)=220

MAPLE

P:=proc(n) local a, i, k, w; for i from 1 by 1 to n do w:=0; k:=i; while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; a:=binomial(i, w); print(a); od; end: P(100);

a:=proc(n) local nn, s: nn:=convert(n, base, 10): s:=sum(nn[j], j=1..nops(nn)): binomial(n, s): end: seq(a(n), n=1..38); - Emeric Deutsch (deutsch(AT)duke.poly.edu), May 04 2007

CROSSREFS

Sequence in context: A008502 A008492 A023035 this_sequence A000582 A145459 A034241

Adjacent sequences: A128933 A128934 A128935 this_sequence A128937 A128938 A128939

KEYWORD

nonn

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Apr 27 2007

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research