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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111696 a(n) = C(n,a)+C(n,b)+C(n,c)... where n = abc... are the decimal digits of n. 3
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 22, 78, 299, 1015, 3018, 8024, 19465, 43776, 92397, 191, 231, 462, 2024, 10902, 53430, 230555, 888381, 3108483, 10015411, 4061, 4526, 5456, 10912, 52360, 331177, 1954932, 10303242, 48911928, 211924271, 91391, 101311 (list; graph; refs; listen; history; internal format)
OFFSET

0,11

COMMENTS

a(10^n) = 10^n. a{(10^n-1)/9} = n*((10^n-1)/9).

a(0)=1 since C(0,0)=1.

EXAMPLE

a(12) = C(12,1)+C(12,2) = 12+66 = 78.

a(111) = 333.

MATHEMATICA

f[n_] := Plus @@ Binomial[n, IntegerDigits[n]]; Table[ f[n], {n, 41}] (* Robert G. Wilson v *)

CROSSREFS

Cf. A111695.

Sequence in context: A070069 A178664 A109687 * A047902 A081930 A143964

Adjacent sequences:  A111693 A111694 A111695 * A111697 A111698 A111699

KEYWORD

base,easy,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 17 2005

EXTENSIONS

Edited, corrected and extended by Robert G. Wilson v (rgwv(at)rgwv.com), Aug 19 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.