|
Search: id:A061762
|
|
|
| A061762 |
|
a(n) = (sum of digits of n) + (product of digits of n). |
|
+0
5
|
|
| 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 2, 5, 8, 11, 14, 17, 20, 23, 26, 29, 3, 7, 11, 15, 19, 23, 27, 31, 35, 39, 4, 9, 14, 19, 24, 29, 34, 39, 44, 49, 5, 11, 17, 23, 29, 35, 41, 47, 53, 59, 6, 13, 20, 27, 34, 41, 48, 55, 62, 69, 7, 15, 23, 31, 39, 47
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
S. Parmeswaran, S+P numbers, Mathematics Informatics Quarterly, Vol. 9, No. 3 Sep. 1999, Bulgaria.
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,1000
Matthew M. Conroy, Home page (listed instead of email address)
|
|
EXAMPLE
|
a(14) = 1+4 + 1*4 = 9.
|
|
PROGRAM
|
(PARI) SumD(x)= { s=0; while (x>9, s=s+x-10*(x\10); x=x\10); return(s + x) } ProdD(x)= { p=1; while (x>9, p=p*(x-10*(x\10)); x=x\10); return(p*x) } { for (n=0, 1000, write("b061762.txt", n, " ", SumD(n) + ProdD(n)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 27 2009]
|
|
CROSSREFS
|
a(n) = A007953(n) + A007954(n). Cf. A061763, A038366.
See A130858 for the smallest inverse.
Sequence in context: A088133 A115299 A076312 this_sequence A136614 A097586 A098727
Adjacent sequences: A061759 A061760 A061761 this_sequence A061763 A061764 A061765
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 20 2001
|
|
EXTENSIONS
|
Corrected and extended by Larry Reeves (larryr(AT)acm.org) and Matthew M. Conroy, May 23 2001
|
|
|
Search completed in 0.002 seconds
|
