login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A067079 Right digitorial function Rd(n) = abcd...*bcd...*cd...*d...*..., for n = abcd... in decimal notation. 9

%I #30 Feb 21 2024 01:44:52

%S 0,1,2,3,4,5,6,7,8,9,0,11,24,39,56,75,96,119,144,171,0,21,44,69,96,

%T 125,156,189,224,261,0,31,64,99,136,175,216,259,304,351,0,41,84,129,

%U 176,225,276,329,384,441,0,51,104,159,216,275,336,399,464,531,0,61,124,189

%N Right digitorial function Rd(n) = abcd...*bcd...*cd...*d...*..., for n = abcd... in decimal notation.

%C Rd(abcd) = abcd*bcd*cd*d, etc.

%H Reinhard Zumkeller, <a href="/A067079/b067079.txt">Table of n, a(n) for n = 0..10000</a>

%F a(n) = Product_{k=1..length(n)} (n-10^k*floor(n/10^k)). - _Vladeta Jovovic_, Jan 08 2002

%F a(n) = 0 iff n == 0 (mod 10). - _M. F. Hasler_, Feb 25 2019

%e Rd(256) = 256*56*6 = 86016.

%t Table[d = IntegerDigits[n]; rd = 1; While[ Length[d] > 0, rd = rd*FromDigits[d]; d = Drop[d, 1]]; rd, {n, 1, 75} ]

%t Join[{0},Table[Times@@FromDigits/@NestList[Rest[#]&,IntegerDigits[n], IntegerLength[ n]-1],{n,70}]] (* _Harvey P. Dale_, Nov 29 2014 *)

%o (Haskell)

%o import Data.List (tails)

%o a067079 = product . map read . init . tails . show :: Integer -> Integer

%o -- _Reinhard Zumkeller_, Apr 23 2013

%o (PARI) A067079(n)=prod(k=1,logint(n+!n,10)+1,n-n\10^k*10^k) \\ _M. F. Hasler_, Feb 25 2019

%Y Cf. A067080.

%K base,nonn,nice,look

%O 0,3

%A _Amarnath Murthy_, Jan 05 2002

%E More terms from _Robert G. Wilson v_, Jan 07 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)