The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A258621 Decimal expansion of sum(1/A030450). 1
 2, 2, 5, 6, 9, 4, 7, 4, 5, 8, 5, 2, 6, 5, 9, 7, 9, 5, 5, 4, 6, 2, 7, 3, 6, 7, 2, 4, 4, 4, 2, 3, 4, 2, 2, 1, 0, 5, 5, 9, 2, 3, 6, 5, 0, 8, 8, 9, 3, 6, 9, 5, 9, 5, 3, 3, 4, 6, 0, 0, 4, 9, 6, 0, 9, 2, 6, 7, 5, 4, 9, 2, 8, 1, 7, 5, 2, 2, 0, 0, 6, 7, 7, 6, 1, 4, 8, 9, 6, 2, 1, 3, 3, 1, 7, 7, 7, 7, 7, 7, 2, 8, 5, 6, 4, 6 (list; constant; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS EXAMPLE 2.2569474585265979554627367244423422105592365088936959533.... PROG (Sage) def A030450(n) :    return prod((n-i+1)^(2^i) for i in (1..n)) N(sum(1/A030450(n) for n in (0..9)), digits=106) (C) #include #include #define dBIT   512 #define dLIST  n, t, u int main (void) { mpfr_t dLIST; mpfr_rnd_t trnd; unsigned int i; trnd = MPFR_RNDU; mpfr_inits2 (dBIT, dLIST, (mpfr_ptr) 0); mpfr_set_d (n, 1.0, trnd); mpfr_set_d (t, 1.0, trnd); for (i = 1; i <= 9; i++) {     mpfr_mul_ui (t, t, i, trnd);     mpfr_mul (t, t, t, trnd);     mpfr_set_d (u, 1.0, trnd);     mpfr_div (u, u, t, trnd);     mpfr_add (n, n, u, trnd); } mpfr_printf ("%.106Rg", n); mpfr_clears (dLIST, (mpfr_ptr) 0); return 0; } CROSSREFS Cf. A030450. Sequence in context: A239262 A288496 A292726 * A258619 A118807 A240309 Adjacent sequences:  A258618 A258619 A258620 * A258622 A258623 A258624 KEYWORD nonn,cons AUTHOR Jani Melik, Jun 06 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 16 06:41 EST 2021. Contains 340204 sequences. (Running on oeis4.)