This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A130250 Minimal index k of a Jacobsthal number such that A001045(k)>=n (the 'upper' Jacobsthal inverse). 7
 0, 1, 3, 3, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Inverse of the Jacobsthal sequence (A001045), nearly, since a(A001045(n))=n except for n=2 (see A130249 for another version). a(n+1) is equal to the partial sum of the Jacobsthal indicator sequence (see A105348). LINKS FORMULA a(n)=ceiling(log_2(3n-1))=1+floor(log_2(3n-2)) for n>=1. Also true: a(n)=A130249(n-1)+1=A130253(n-1) for n>=1. G.f.: g(x)=x/(1-x)*sum{k>=0, x^A001045(k)}. EXAMPLE a(10)=5 because A001045(5)=11>=10, but A001045(4)=5<10 CROSSREFS For partial sums see A130252. Other related sequences A130249, A130253, A105348. A001045, A130234, A130242. Sequence in context: A303821 A240622 * A130253 A145288 A075324 A134993 Adjacent sequences:  A130247 A130248 A130249 * A130251 A130252 A130253 KEYWORD nonn AUTHOR Hieronymus Fischer, May 20 2007 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 December 12 07:45 EST 2018. Contains 318053 sequences. (Running on oeis4.)