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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A122841 Greatest k such that 6^k divides n. 36
0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,36

COMMENTS

See A054895 for the partial sums. - Hieronymus Fischer, Jun 08 2012

a(A047253(n)) = 0; a(A008588(n)) > 0; a(A044102(n)) > 1. - Reinhard Zumkeller, Nov 10 2013

6^a(n) = A234959(n), n >= 1. - Wolfdieter Lang, Jun 30 2014

LINKS

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

FORMULA

From Hieronymus Fischer, Jun 03 2012: (Start)

With m = floor(log_6(n)), frac(x) = x-floor(x):

a(n) = sum_{j=1..m} (1 - ceiling(frac(n/6^j))).

a(n) = m + sum_{j=1..m} (floor(-frac(n/6^j))).

a(n) = A054895(n) - A054895(n-1).

G.f.: g(x)= sum_{j>0} x^6^j/(1-x^6^j). (End)

PROG

(Haskell)

a122841 = f 0 where

   f y x = if r > 0 then y else f (y + 1) x'

           where (x', r) = divMod x 6

-- Reinhard Zumkeller, Nov 10 2013

CROSSREFS

Cf. A122840, A007814, A054895, A234959.

Sequence in context: A070205 A138363 A080225 * A060862 A066087 A080224

Adjacent sequences:  A122838 A122839 A122840 * A122842 A122843 A122844

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Sep 13 2006

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified April 25 08:30 EDT 2017. Contains 285348 sequences.