The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A104863 a(n) = floor(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=10, a(2)=30. 3
 10, 30, 31, 43, 53, 68, 86, 109, 138, 175, 222, 282, 358, 455, 578, 735, 935, 1189, 1512, 1923, 2446, 3111, 3957, 5033, 6402, 8143, 10358, 13175, 16759, 21317, 27116, 34491, 43873, 55807, 70987, 90297, 114859, 146103, 185845, 236398, 300703, 382500, 486547, 618897 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 FORMULA For n>=17, a(n) = a(n-2) + a(n-4) + 1 (conjectured). If true then for m>5, a(2*m+1) = 4*F(m) + 25*F(m+1) + 1 and a(2*m+2) = 8*F(m) + 30*F(m+1) + 1 with F(n) = A000045(n). - Ralf Stephan, Nov 15 2010 MATHEMATICA nxt[{a_, b_}]:={b, Floor[Sqrt[a^2+b^2]]}; Transpose[NestList[nxt, {10, 30}, 60]][[1]] (* Harvey P. Dale, Jun 18 2013 *) PROG (MAGMA) A104863:= func< n| n lt 3 select 10*(2*n-1) else Floor(Sqrt(Self(n-1)^2 +Self(n-2)^2)) >; [A104863(n): n in [1..60]]; // G. C. Greubel, Jun 27 2021 (Sage) @CachedFunction def a(n): return 10*(2*n-1) if (n<3) else floor(sqrt(a(n-1)^2 + a(n-2)^2)) [a(n) for n in (1..60)] # G. C. Greubel, Jun 27 2021 CROSSREFS Cf. A104803, A104804, A104805, A104806, A104864. Sequence in context: A002422 A031195 A034117 * A326122 A027183 A333300 Adjacent sequences:  A104860 A104861 A104862 * A104864 A104865 A104866 KEYWORD nonn AUTHOR Zak Seidov, Mar 28 2005 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 7 13:08 EST 2021. Contains 349581 sequences. (Running on oeis4.)