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!)
A101360 a(n) = ceiling((3-sqrt(3))*4^(n-3)) + 1. 0
2, 2, 2, 3, 7, 22, 83, 326, 1300, 5195, 20776, 83098, 332387, 1329543, 5318166, 21272659, 85090631, 340362521, 1361450080, 5445800316, 21783201259, 87132805033, 348531220128, 1394124880509, 5576499522030, 22305998088117 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Essentially the same as A094062: a(n) = A094062(n) for n>=2.
An approximation to the Camel Problem.
LINKS
MAPLE
Digits:=100; seq(ceil((3-sqrt(3))*4^(n-3)) + 1, n=0..30);
MATHEMATICA
With[{c=3-Sqrt[3]}, Ceiling[c*4^Range[-3, 30]]+1] (* Harvey P. Dale, Jan 27 2013 *)
CROSSREFS
Cf. A094062.
Sequence in context: A181056 A200918 A134890 * A270371 A351108 A184311
KEYWORD
nonn
AUTHOR
Jorge Coveiro, Dec 25 2004
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 23 07:11 EDT 2024. Contains 371905 sequences. (Running on oeis4.)