Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123560
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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, 1, 2, 2, 3, 4, 5, 15, 67, 535, 8986, 912849, 1662587477, 81083409799344, 651628371908007046307, 17425286333232464262345491287814, 67473400772659322911375035883722405962101960016 (list; graph; listen)
OFFSET

1,3

FORMULA

a_n = ceil(sqrt(e-sum(i=1 to 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 that 1/1^2 + 1/1^2 + 1/2^2 + 1/k^2 < e.

PROGRAM

(PARI) l(x)=ceil(sqrt(1/x)); k=exp(1); for(T=1, 50, print(l(k)); k=k-1/l(k)^2)}

CROSSREFS

Adjacent sequences: A123557 A123558 A123559 this_sequence A123561 A123562 A123563

Sequence in context: A116676 A100483 A014535 this_sequence A060407 A074077 A078381

KEYWORD

nonn

AUTHOR

Hauke Worpel (hw1(AT)email.com), Nov 11 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research