cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A254406 a(n) = floor(a(n-1)^(5/2)), a(1) = 2.

This page as a plain text file.
%I A254406 #7 Apr 18 2022 12:01:54
%S A254406 2,5,55,22434,75381849525,1560152215306022835807766096,
%T A254406 96142947030750035305397690793504947854390697291777107758182668001398
%N A254406 a(n) = floor(a(n-1)^(5/2)), a(1) = 2.
%C A254406 The next term -- a(8) -- has 170 digits. - _Harvey P. Dale_, Apr 18 2022
%F A254406 a(n) ~ c^((5/2)^n), where c = 1.292359119971021796628915278748164958162881226395259818195999161... .
%t A254406 RecurrenceTable[{a[1]==2,a[n]==Floor[a[n-1]^(5/2)]},a,{n,1,10}]
%t A254406 NestList[Floor[(Sqrt[#])^5]&,2,10] (* _Harvey P. Dale_, Apr 18 2022 *)
%Y A254406 Cf. A254405.
%K A254406 nonn,easy
%O A254406 1,1
%A A254406 _Vaclav Kotesovec_, Jan 30 2015