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!)
A071980 If n = abcd (say) in decimal, then a(n) = a + ab + abc + abcd + bcd + cd + d. 4

%I #14 May 06 2019 08:28:22

%S 0,1,2,3,4,5,6,7,8,9,11,13,15,17,19,21,23,25,27,29,22,24,26,28,30,32,

%T 34,36,38,40,33,35,37,39,41,43,45,47,49,51,44,46,48,50,52,54,56,58,60,

%U 62,55,57,59,61,63,65,67,69,71,73,66,68,70,72,74,76,78,80,82,84,77,79

%N If n = abcd (say) in decimal, then a(n) = a + ab + abc + abcd + bcd + cd + d.

%H Zak Seidov, <a href="/A071980/b071980.txt">Table of n, a(n) for n = 0..10000</a>

%e a(1347) = 1 + 13 + 134 + 1347 + 347 + 47 + 7 = 1896.

%p read("transforms"):

%p A071980 := proc(n)

%p local a,dgs,d ;

%p a := n ;

%p dgs := convert(n,base,10) ;

%p for d from 1 to nops(dgs) do

%p [op(d+1..nops(dgs),dgs)] ;

%p a := a+digcatL(%) ;

%p [op(1..nops(dgs)-d,dgs)] ;

%p a := a+digcatL(%) ;

%p end do:

%p a ;

%p end proc: # _R. J. Mathar_, May 06 2019

%t f[n_] := Block[{lead = IntegerDigits[n], trail = IntegerDigits[n], flr = Floor[Log[10, n] + 1], s = -n}, While[flr > 0, s = s + FromDigits[lead] + FromDigits[trail]; lead = Drop[lead, -1]; trail = Drop[trail, 1]; flr--]; s]; Table[f[n], {n, 0, 80}]

%t Table[n+Sum[Quotient[n,10^k]+Mod[n,10^k],{k,1,Log[10,n]}],{n,0,100}](* _Zak Seidov_, May 16 2013 *)

%o (PARI) a(n)=local(l); if(n<1,0,l=1+log(n)\log(10); sum(i=1,l-1,n\10^i+n%(10^i),n))

%Y Cf. A225580. - _Zak Seidov_, May 16 2013

%K base,nonn

%O 0,3

%A _Amarnath Murthy_, Jun 18 2002

%E Edited by _Robert G. Wilson v_, Jun 23 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 02:28 EDT 2024. Contains 371917 sequences. (Running on oeis4.)