Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060851
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060851 (2n-1) * (3^(2n-1)). +0
2
3, 81, 1215, 15309, 177147, 1948617, 20726199, 215233605, 2195382771, 22082967873, 219667417263, 2165293113021, 21182215236075, 205891132094649, 1990280943581607, 19147875284802357, 183448998696332259 (list; graph; listen)
OFFSET

1,1

REFERENCES

S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 28-40.

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,200

S. R. Finch, Euler' s constant C0

Xavier Gourdon and Pascal Sebah, Riemann's zeta function

Simon Plouffe, Other interesting computations

EXAMPLE

ln(2) = sum( 2 / a(n)) for n = 1..infinity

C0 = sum( 2 / a(n) - zeta(2n+1) / [ ( 2^(2n)) * (2n+1) ] )

C0 = sum( [ (4n+2) / a(n) - zeta(2n+1) / (2^(2n)) ] / (2n+1))

7/4= sum( [ (4n+2) / a(n) - zeta(2n+1) / (2^(2n)) ] )

7/8= sum( [ (2n+1) / a(n) - zeta(2n+1) / (2^(2n+1)) ] )

PROGRAM

(PARI) { for (n=1, 200, write("b060851.txt", n, " ", (2*n - 1)*(3^(2*n - 1))); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 13 2009]

CROSSREFS

For ln(2) see A002162, for Euler's constant C0 see A001620.

Sequence in context: A116009 A068562 A123656 this_sequence A116179 A013732 A060722

Adjacent sequences: A060848 A060849 A060850 this_sequence A060852 A060853 A060854

KEYWORD

nonn,easy

AUTHOR

Frank Ellermann (Frank.Ellermann(AT)t-online.de), May 03 2001

EXTENSIONS

More terms from Larry Reeves (larryr(AT)acm.org), May 07 2001

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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research