cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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, 125, 156, 189, 224, 261, 0, 31, 64, 99, 136, 175, 216, 259, 304, 351, 0, 41, 84, 129, 176, 225, 276, 329, 384, 441, 0, 51, 104, 159, 216, 275, 336, 399, 464, 531, 0, 61, 124, 189
Offset: 0

Views

Author

Amarnath Murthy, Jan 05 2002

Keywords

Comments

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

Examples

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

Crossrefs

Cf. A067080.

Programs

  • Haskell
    import Data.List (tails)
    a067079 = product . map read . init . tails . show :: Integer -> Integer
    -- Reinhard Zumkeller, Apr 23 2013
    
  • Mathematica
    Table[d = IntegerDigits[n]; rd = 1; While[ Length[d] > 0, rd = rd*FromDigits[d]; d = Drop[d, 1]]; rd, {n, 1, 75} ]
    Join[{0},Table[Times@@FromDigits/@NestList[Rest[#]&,IntegerDigits[n], IntegerLength[ n]-1],{n,70}]] (* Harvey P. Dale, Nov 29 2014 *)
  • PARI
    A067079(n)=prod(k=1,logint(n+!n,10)+1,n-n\10^k*10^k) \\ M. F. Hasler, Feb 25 2019

Formula

a(n) = Product_{k=1..length(n)} (n-10^k*floor(n/10^k)). - Vladeta Jovovic, Jan 08 2002
a(n) = 0 iff n == 0 (mod 10). - M. F. Hasler, Feb 25 2019

Extensions

More terms from Robert G. Wilson v, Jan 07 2002