Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A141411
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A141411 Defined in comments. +0
3
3, 1, 31, 28, 365, 514, 4388, 8220, 53871, 122284, 673222, 1748055, 8535397, 24383499, 109449848, 334783855, 1415768769, 4548229589, 18434398665, 61345927764, 241210652738, 823296868656, 3167642169823, 11010462627756, 41708741708554, 146886286090602 (list; graph; listen)
OFFSET

0,1

COMMENT

Given any sequence {u(i), i >= 0} we define a family of polynomials by P(0,x) = u(0), P(n,x) = u(n) + x*Sum_{ i=0..n-1 } (u(i)*P(n-i-1, x). Then we set a(n) = (P(n,-1)+P(n,1))/2.

For the present exanmple we take {u(i)} to be 3,1,4,1,5,9,... (A000796).

REFERENCES

P. Curtz, Gazette des Mathematiciens, 1992, 52, p.44.

P. Flajolet, X. Gourdon and B. Salvy, Gazette des Mathematiciens, 1993, 55, pp.67-78 .

MAPLE

u:= proc(n) Digits:= max(n+10);

trunc (10* frac (evalf (Pi*10^(n-1))))

end:

P:= proc(n) option remember; local i, x;

if n=0 then u(0)

else unapply

(expand (u(n) +x *add (u(i) *P(n-i-1)(x), i=0..n-1)), x)

fi

end:

a:= n-> (P(n)(1)+P(n)(-1))/2:

seq (a(n), n=0..30);

CROSSREFS

See A130620 for another version.

Sequence in context: A165624 A120066 A046979 this_sequence A016481 A047815 A095844

Adjacent sequences: A141408 A141409 A141410 this_sequence A141412 A141413 A141414

KEYWORD

nonn,easy

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Jun 18 2007

EXTENSIONS

Edited by N. J. A. Sloane, Aug 26 2009

Corrected and extended with Maple program by Alois Heinz (heinz(AT)hs-heilbronn.de), Sep 06 2009

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 23 10:40 EST 2009. Contains 167421 sequences.


AT&T Labs Research