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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130169 a(1) = 1; for n>1, a(n) = (c(n) + c(n+1))/2, where c(n) = A130168(n). 2
1, 2, 9, 63, 621, 8127, 135729, 2810403, 70558101, 2109957687, 74061977049, 3014272078443, 140764140297981, 7474792551154047, 447790997859123969, 30053688313164013683, 2245843775591721612261, 185829940905166760571207, 16941047558158020804504489 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..19.

Hippolyte Dellac, Note sur l'élimination, méthode de parallélogramme, Annales de la Faculté des Sciences de Marseille, XI (1901), 141-164. [Warning 76 Mb; go to p. 81 in the pdf file]

FORMULA

G.f.: (1+x)^2/(3*x^3)*Q(0) + (x^3 - 5*x^2 - 5*x - 2)/(6*x^3), where Q(k) = 1 - x*(k+1)^2/( x*(k+1)^2 - 2/(1 - x*(k+1)^2/( x*(k+1)^2 - 2/Q(k+1) ))); (continued fraction). - Sergei N. Gladkovskii, Oct 22 2013

MATHEMATICA

b[n_] := (-2^(-1))^(n-2)*Sum[Binomial[n, k]*(1-2^(n+k+1))* BernoulliB[n+k+1], {k, 0, n}];

c[n_] := (b[n] + b[n+1])/3;

a[n_] := If[n == 1, 1, (c[n] + c[n+1])/2];

a /@ Range[1, 19] (* Jean-François Alcover, Apr 08 2021 *)

CROSSREFS

Cf. A000366, A130168.

Sequence in context: A212413 A003577 A085928 * A218672 A253109 A167913

Adjacent sequences:  A130166 A130167 A130168 * A130170 A130171 A130172

KEYWORD

nonn

AUTHOR

Don Knuth, Aug 02 2007

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 20 17:01 EDT 2021. Contains 345177 sequences. (Running on oeis4.)