Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,5

EXAMPLE

Antidiagonals: 1; 1,1; 1,2,1; 1,3,5,1; 1,4,9,13,1; ...

PROGRAM

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

CROSSREFS

A005183(n)=T(1, n), A002064(n)=T(2, n), A048474(n)=T(3, n), A000337(n)=T(4, n), A016813(n)=T(n, 2), A017533(n)=T(n, 3). Cf. A049069, A048472.

Essentially the same as A049069.

Sequence in context: A153899 A068098 A135722 this_sequence A121207 A097084 A143327

Adjacent sequences: A049510 A049511 A049512 this_sequence A049514 A049515 A049516

KEYWORD

nonn,tabl,easy

AUTHOR

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 December 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research