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

 

Logo

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!)
A256556 If n = 10k+m (0 <= m <= 9) then a(n) = n*k^m. 1
0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 42, 88, 184, 384, 800, 1664, 3456, 7168, 14848, 30, 93, 288, 891, 2754, 8505, 26244, 80919, 249318, 767637, 40, 164, 672, 2752, 11264, 46080, 188416, 770048, 3145728, 12845056, 50, 255, 1300, 6625 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,10

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

EXAMPLE

10 yields 10*(1^0) = 10;

43 yields 43*(4^3)= 43*64=2754;

68 yields 68*(6^8)= 68*1679616 = 114213888.

MAPLE

f:=proc(n) local k, m; m := (n mod 10); k := (n-m)/10; n*k^m; end;

[seq(f(n), n=1..40)];

PROG

(Haskell)

a256556 n = n * uncurry (^) (divMod n 10)

-- Reinhard Zumkeller, May 02 2015

CROSSREFS

Sequence in context: A008717 A175405 A225683 * A063662 A069715 A248499

Adjacent sequences:  A256553 A256554 A256555 * A256557 A256558 A256559

KEYWORD

nonn,look

AUTHOR

Andy Edwards, Apr 01 2015

EXTENSIONS

Entry revised by N. J. A. Sloane, May 02 2015

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 January 17 14:12 EST 2019. Contains 319225 sequences. (Running on oeis4.)