login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098167 a(n)= sum for i=2 to n of the sequence A098166. 3
2, 6, 11, 17, 24, 34, 43, 57, 70, 91, 108, 123, 147, 166, 187, 215, 239, 265, 296, 321, 344, 368, 393, 447, 479, 509, 545, 601, 655, 703 (list; graph; refs; listen; history; internal format)
OFFSET

2,1

COMMENTS

Define a(n) to be the numerator of a fraction sequence F(n) Define triangular numbers ( A000217 ) as the denominator of the fraction sequence F(n) Conjecture : as n tends to infinity F(n) tends to Log(e*pi/2) e=2,718281... pi=3.141592... I have computed the values of A055211 up to n=1725

CROSSREFS

Cf. A000217 A055211 A098166.

Sequence in context: A078476 A099056 A046691 * A081689 A176708 A104813

Adjacent sequences:  A098164 A098165 A098166 * A098168 A098169 A098170

KEYWORD

nonn

AUTHOR

Pierre CAMI (pierre-cami(AT)bbox.fr), Aug 30 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 07:10 EST 2012. Contains 205874 sequences.