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!)
A127904 Smallest m such that A008687(m) = n. 3
0, 1, 3, 5, 9, 17, 33, 65, 129, 257, 513, 1025, 2049, 4097, 8193, 16385, 32769, 65537, 131073, 262145, 524289, 1048577, 2097153, 4194305, 8388609, 16777217, 33554433, 67108865, 134217729, 268435457, 536870913, 1073741825, 2147483649 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
A008687(a(n)) = n and A008687(m) < n for m < a(n).
LINKS
FORMULA
For n>1, a(n) = A000051(n-1) = 2^(n-1)+1.
From Bruno Berselli, Sep 01 2011: (Start)
G.f.: x*(1-2*x^2)/((1-x)*(1-2*x)).
a(n) = 3*a(n-1) -2*a(n-2) for n=2 and n>3. (End)
MATHEMATICA
Join[{0, 1}, LinearRecurrence[{3, -2}, {3, 5}, 40]] (* or *) Join[{0, 1}, 2^Range[ 40]+1] (* Harvey P. Dale, Jan 16 2013 *)
PROG
(PARI) x='x+O('x^30); concat([0], Vec(x*(1-2*x^2)/((1-x)*(1-2*x)))) \\ G. C. Greubel, Apr 30 2018
(PARI) a(n) = if(n<2, n, 2^(n-1)+1); \\ Altug Alkan, May 01 2018
(Magma) m:=30; R<x>:=PowerSeriesRing(Rationals(), m); [0] cat Coefficients(R!(x*(1-2*x^2)/((1-x)*(1-2*x)))); // G. C. Greubel, Apr 30 2018
CROSSREFS
Sequence in context: A205537 A135728 A083318 * A048578 A087312 A099170
KEYWORD
nonn,easy
AUTHOR
Reinhard Zumkeller, Feb 05 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 13:29 EDT 2024. Contains 371780 sequences. (Running on oeis4.)