Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059268
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A059268 Concatenate subsequences [2^0, 2^1, ..., 2^n] for n = 0, 1, 2, ... +0
11
1, 1, 2, 1, 2, 4, 1, 2, 4, 8, 1, 2, 4, 8, 16, 1, 2, 4, 8, 16, 32, 1, 2, 4, 8, 16, 32, 64, 1, 2, 4, 8, 16, 32, 64, 128, 1, 2, 4, 8, 16, 32, 64, 128, 256, 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 1, 2, 4, 8, 16, 32, 64 (list; table; graph; listen)
OFFSET

0,3

COMMENT

Triangular array T(n,k) read by rows, where T(n,k) = i!*j! times coefficient of x^n*y^k in exp(x+2y).

LINKS

J. L. Arregui, Tangent and Bernoulli numbers related to Motzkin and Catalan numbers by means of numerical triangles.

FORMULA

E.g.f.: exp(x+2*y) (T coordinates).

CROSSREFS

Adjacent sequences: A059265 A059266 A059267 this_sequence A059269 A059270 A059271

Sequence in context: A085683 A081532 A131074 this_sequence A123937 A138882 A074634

KEYWORD

nonn,tabl

AUTHOR

njas, Jan 23 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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research