Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111696
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A111696
%S A111696 1,1,1,1,1,1,1,1,1,1,11,22,78,299,1015,3018,8024,19465,43776,92397,191,
%T A111696 231,462,2024,10902,53430,230555,888381,3108483,10015411,4061,4526,5456,
%U A111696 10912,52360,331177,1954932,10303242,48911928,211924271,91391,101311
%N A111696 a(n) = C(n,a)+C(n,b)+C(n,c)... where n = abc... are the decimal digits 
               of n.
%C A111696 a(10^n) = 10^n. a{(10^n-1)/9} = n*((10^n-1)/9).
%C A111696 a(0)=1 since C(0,0)=1.
%e A111696 a(12) = C(12,1)+C(12,2) = 12+66 = 78.
%e A111696 a(111) = 333.
%t A111696 f[n_] := Plus @@ Binomial[n, IntegerDigits[n]]; Table[ f[n], {n, 41}] 
               (* Robert G. Wilson v *)
%Y A111696 Cf. A111695.
%Y A111696 Sequence in context: A005015 A070069 A109687 this_sequence A047902 A081930 
               A143964
%Y A111696 Adjacent sequences: A111693 A111694 A111695 this_sequence A111697 A111698 
               A111699
%K A111696 base,easy,nonn
%O A111696 0,11
%A A111696 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 17 2005
%E A111696 Edited, corrected and extended by Robert G. Wilson v (rgwv(at)rgwv.com), 
               Aug 19 2005

    
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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research