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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061486 Let the number of digits in n be k; a(n) = sum of the products of the digits of n taken r at a time where r ranges from 1 to k. 1
1, 2, 3, 4, 5, 6, 7, 8, 9, 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, 55, 63, 71 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

EXAMPLE

a(34) = 3 + 4 + 3*4 = 19, a(124) = (1+2+4)+(1*2+2*4+1*4)+(1*2*4) = 29.

CROSSREFS

Sequence in context: A101337 A135208 A156207 * A138470 A112875 A113018

Adjacent sequences:  A061483 A061484 A061485 * A061487 A061488 A061489

KEYWORD

nonn,base,easy

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 06 2001

EXTENSIONS

More terms from Erich Friedman (efriedma(AT)stetson.edu), Jun 03 2001

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 17 23:08 EST 2012. Contains 206085 sequences.