The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A290566 Coefficients in 5-adic expansion of 2^(1/3). 17
 3, 0, 2, 2, 3, 1, 4, 0, 2, 3, 0, 0, 4, 0, 4, 4, 3, 1, 1, 2, 0, 0, 2, 4, 0, 0, 2, 1, 4, 2, 2, 4, 0, 4, 2, 3, 1, 2, 3, 0, 0, 2, 0, 3, 4, 4, 2, 3, 2, 0, 4, 1, 2, 2, 3, 3, 0, 4, 2, 2, 3, 4, 4, 3, 4, 0, 2, 1, 2, 3, 4, 4, 2, 3, 3, 0, 3, 4, 1, 3, 1, 0, 2, 2, 1, 4, 4, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Seiichi Manyama, Table of n, a(n) for n = 0..10000 PROG (Ruby) require 'OpenSSL' def f_a(ary, a)   (0..ary.size - 1).inject(0){|s, i| s + ary[i] * a ** i} end def df(ary)   (1..ary.size - 1).map{|i| i * ary[i]} end def A(c_ary, k, m, n)   x = OpenSSL::BN.new((-f_a(df(c_ary), k)).to_s).mod_inverse(m).to_i % m   f_ary = c_ary.map{|i| x * i}   f_ary[1] += 1   d_ary = []   ary = [0]   a, mod = k, m   (n + 1).times{|i|     b = a % mod     d_ary << (b - ary[-1]) / m ** i     ary << b     a = f_a(f_ary, b)     mod *= m   }   d_ary end def A290566(n)   A([-2, 0, 0, 1], 3, 5, n) end p A290566(100) (PARI) Vecrev( digits( truncate( (2+O(5^100))^(1/3) ), 5) ) \\ Joerg Arndt, Aug 06 2017 CROSSREFS Cf. A290563, A290567. Sequence in context: A004587 A104609 A326395 * A285006 A300722 A087625 Adjacent sequences:  A290563 A290564 A290565 * A290567 A290568 A290569 KEYWORD nonn AUTHOR Seiichi Manyama, Aug 06 2017 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 19 14:53 EST 2020. Contains 331049 sequences. (Running on oeis4.)