Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130250
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130250 Minimal index k of a Jacobsthal number such that A001045(k)>=n (the 'upper' Jacobsthal inverse). +0
9
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; listen)
OFFSET

0,3

COMMENT

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).

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: A136546 A058729 A021303 this_sequence A130253 A075324 A134993

Adjacent sequences: A130247 A130248 A130249 this_sequence A130251 A130252 A130253

KEYWORD

nonn

AUTHOR

Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), May 20 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research