The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A211072 Sum of numbers with no '0' decimal digits whose sum of digits equals n. 1
 1, 13, 147, 1625, 17891, 196833, 2165227, 23817625, 261994131, 2881935943, 31701296375, 348714262017, 3835856884757, 42194425724149, 464138682802857, 5105525508895321, 56160780576260645, 617768586100819485, 6795454444489330049, 74749998860563784655 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Different from A016135. LINKS Laurent Desnogues, Table of n, a(n) for n = 1..31 Project Euler, Problem 377 Tadao Takaoku, A two-level algorithm for generating multiset permutations, RIMS Kokyuroku 1644 (2009), pp. 95-109. EXAMPLE 2 and 11 are the only numbers without 0s which have digit sum 2, so a(2) = 2 + 11. CROSSREFS Sequence in context: A048442 A051524 A110748 * A016135 A210165 A132156 Adjacent sequences:  A211069 A211070 A211071 * A211073 A211074 A211075 KEYWORD nonn,base AUTHOR Laurent Desnogues and Charles R Greathouse IV, Apr 02 2012 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.

Last modified January 19 06:37 EST 2020. Contains 331033 sequences. (Running on oeis4.)