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!)
A104805 "Ceiling of hypotenuses": a(n) = ceiling(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=1, a(2)=3. 6

%I #6 Mar 27 2015 23:02:58

%S 1,3,4,5,7,9,12,15,20,25,33,42,54,69,88,112,143,182,232,295,376,478,

%T 609,775,986,1255,1597,2032,2585,3289,4184,5322,6770,8612,10955,13935,

%U 17726,22548,28682,36484,46409,59033,75092,95519,121502,154553,196595,250073

%N "Ceiling of hypotenuses": a(n) = ceiling(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=1, a(2)=3.

%t a[n_] := a[n] = Ceiling[ Sqrt[ a[n - 1]^2 + a[n - 2]^2]]; a[1] = 1; a[2] = 3; Table[ a[n], {n, 48}] (* _Robert G. Wilson v_, Mar 28 2005 *)

%Y Cf. A104803, A104804.

%K nonn

%O 1,2

%A _Zak Seidov_, Mar 26 2005

%E More terms from _Robert G. Wilson v_, Mar 28 2005

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 19 02:45 EDT 2024. Contains 371782 sequences. (Running on oeis4.)