Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049069
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049069 Array T by antidiagonals: T(k,n)=k*n*2^(n-1)+1, n >= 0, k >= 1. +0
3
1, 1, 2, 1, 3, 5, 1, 4, 9, 13, 1, 5, 13, 25, 33, 1, 6, 17, 37, 65, 81, 1, 7, 21, 49, 97, 161, 193, 1, 8, 25, 61, 129, 241, 385, 449, 1, 9, 29, 73, 161, 321, 577, 897, 1025, 1, 10, 33, 85, 193, 401, 769, 1345, 2049, 2305, 1, 11, 37, 97, 225, 481, 961, 1793, 3073 (list; table; graph; listen)
OFFSET

0,3

EXAMPLE

Antidiagonals: {1}; {1,2}; {1,3,5}; ...

PROGRAM

(PARI) T(k, n)=k*n*2^(n-1)+1

CROSSREFS

Transpose of the array in A048472.

Row 1 = (1, 2, 5, 13, 33, ...) = A005183.

Row 2 = (1, 3, 9, 25, 65, ...) = A002064.

Cf. A049513.

Essentially the same as A049513.

Sequence in context: A076110 A117584 A047997 this_sequence A030237 A118243 A134081

Adjacent sequences: A049066 A049067 A049068 this_sequence A049070 A049071 A049072

KEYWORD

nonn,tabl,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Clark Kimberling (ck6(AT)evansville.edu), Michael Somos

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research