Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084803
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084803 Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(40+I*9)/41. +0
3
1, 1285, 1290, 1296, 1301, 1306, 1312, 1317, 1323, 1328, 1334, 1339, 1344, 1350, 1355, 1361, 1366, 1372, 1377, 1382, 1388, 1393, 1399, 1404, 1410, 1415, 1421, 1426, 1431, 1437, 1442, 1448, 1453, 1459, 1464, 1469, 1475, 1480, 1486, 1491, 1497, 1502 (list; graph; listen)
OFFSET

1,2

COMMENT

Sequence satisfies sum(n>0,1/a(n)^z)=0 by requiring that the modulus of the successive partial sums are monotonically decreasing in magnitude for the given z.

PROGRAM

(PARI) S=0; w=1; a=0; for(n=1, 100, b=a+1; while(abs(S+exp(-z*log(b)))>w, b++); S=S+exp(-z*log(b)); w=abs(S); a=b; print1(b, ", "))

CROSSREFS

Cf. A084589, A084799-A084802, A084804-A084810.

Sequence in context: A038652 A031798 A090006 this_sequence A104399 A140914 A020401

Adjacent sequences: A084800 A084801 A084802 this_sequence A084804 A084805 A084806

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jun 04 2003

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 September 8 08:06 EDT 2008. Contains 143486 sequences.


AT&T Labs Research