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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A219667 Number of happy numbers without zeros and with digits in nondecreasing order <= 10^n. 4
1, 2, 10, 30, 111, 296, 711, 1625, 3583, 7088, 13377, 24143, 41376, 68551, 111068, 174887, 269592, 410043, 612350, 900484, 1310108, 1879862, 2664399, 3740002, 5188376, 7121305, 9687674, 13044961, 17402217, 23026128, 30200375, 39290567, 50744867, 65045752, 82799083 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Bryan Wolf, Table of n, a(n) for n = 0..10000

Bryan Wolf, C++ program for generating n, a(n)

FORMULA

h(d,n,x) = h(d-1,n-x^2,x) + h(d-1,n-(x+1)^2,x+1) + ... + h(n-1,n-9^2,9) where h() is the number of d-digit long happy numbers with digits in nondecreasing order,

n is the sum of the squares of the digits in the happy numbers, and x is the lowest digit in the happy numbers.

a(n) is the sum of all h(d,0 <= x <= 81*d, 1), where x is a happy number.

EXAMPLE

h(0, 0, 1 <= x <= 9) = 1,

h(d, n, x) = 0 for all n < 0,

h(d, n, x) = 0 for all n > 81*d.

CROSSREFS

Cf. A007770, A068571, A124095.

Sequence in context: A318579 A064932 A285956 * A192381 A162249 A268688

Adjacent sequences:  A219664 A219665 A219666 * A219668 A219669 A219670

KEYWORD

base,nonn

AUTHOR

Bryan Wolf, Nov 30 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 15 06:12 EDT 2021. Contains 342975 sequences. (Running on oeis4.)