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!)
A123560 a(n) is the smallest integer such that 1/a(1)^2 + 1/a(2)^2 + ... + 1/a(n-1)^2 + 1/a(n)^2 is less than e. 0
1, 1, 2, 2, 3, 4, 5, 15, 67, 535, 8986, 912849, 1662587477, 81083409799344, 651628371908007046307, 17425286333232464262345491287814, 67473400772659322911375035883722405962101960016 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = ceiling(sqrt(e - Sum_{i=1..n-1} 1/a(i)^2))
EXAMPLE
a(4) = 2 because the first three terms of the sequence are 1,1,2 and 2 is the smallest integer k such that 1/1^2 + 1/1^2 + 1/2^2 + 1/k^2 < e.
PROG
(PARI) l(x)=ceil(sqrt(1/x)); k=exp(1); for(T=1, 50, print(l(k)); k=k-1/l(k)^2)}
CROSSREFS
Sequence in context: A210642 A263140 A205006 * A060407 A083702 A074077
KEYWORD
nonn
AUTHOR
Hauke Worpel (hw1(AT)email.com), Nov 11 2006
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 May 11 22:00 EDT 2024. Contains 372431 sequences. (Running on oeis4.)