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!)
A346689 Replace 5^k with (-1)^k in base-5 expansion of n. 8

%I #12 Aug 01 2021 14:43:58

%S 0,1,2,3,4,-1,0,1,2,3,-2,-1,0,1,2,-3,-2,-1,0,1,-4,-3,-2,-1,0,1,2,3,4,

%T 5,0,1,2,3,4,-1,0,1,2,3,-2,-1,0,1,2,-3,-2,-1,0,1,2,3,4,5,6,1,2,3,4,5,

%U 0,1,2,3,4,-1,0,1,2,3,-2,-1,0,1,2,3,4,5,6,7,2,3,4,5,6,1,2,3,4,5,0,1,2,3,4,-1,0,1,2,3,4,5,6,7,8

%N Replace 5^k with (-1)^k in base-5 expansion of n.

%C If n has base-5 expansion abc..xyz with least significant digit z, a(n) = z - y + x - w + ...

%F G.f. A(x) satisfies: A(x) = x * (1 + 2*x + 3*x^2 + 4*x^3) / (1 - x^5) - (1 + x + x^2 + x^3 + x^4) * A(x^5).

%F a(n) = n + 6 * Sum_{k>=1} (-1)^k * floor(n/5^k).

%e 48 = 143_5, 3 - 4 + 1 = 0, so a(48) = 0.

%t nmax = 104; A[_] = 0; Do[A[x_] = x (1 + 2 x + 3 x^2 + 4 x^3)/(1 - x^5) - (1 + x + x^2 + x^3 + x^4) A[x^5] + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]

%t Table[n + 6 Sum[(-1)^k Floor[n/5^k], {k, 1, Floor[Log[5, n]]}], {n, 0, 104}]

%o (Python)

%o from sympy.ntheory.digits import digits

%o def a(n):

%o return sum(bi*(-1)**k for k, bi in enumerate(digits(n, 5)[1:][::-1]))

%o print([a(n) for n in range(105)]) # _Michael S. Branicky_, Jul 29 2021

%Y Cf. A007091, A053824, A055017, A065359, A065368, A346688, A346690, A346691.

%K sign,base

%O 0,3

%A _Ilya Gutkovskiy_, Jul 29 2021

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 July 16 00:06 EDT 2024. Contains 374343 sequences. (Running on oeis4.)