Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102472
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102472 Triangle read by rows. Let S(k) be the sequence defined by F(0)=0, F(1)=1, F(n-1) + (n+k)*F(n) = F(n+1). E.g. S(0) = 0,1,1,3,10,43,225,1393,9976,81201, ... Then S(0), S(1), S(2), ... are written vertically, next to each other, with the initial term of each on the next row down. +0
2
1, 1, 1, 3, 2, 1, 10, 7, 3, 1, 43, 30, 13, 4, 1, 225, 157, 68, 21, 5, 1, 1393, 972, 421, 130, 31, 6, 1, 9976, 6961, 3015, 931, 222, 43, 7, 1, 81201, 56660, 24541, 7578, 1807, 350, 57, 8, 1, 740785, 516901, 223884, 69133, 16485, 3193, 520, 73, 9, 1 (list; table; graph; listen)
OFFSET

1,4

EXAMPLE

Triangle begins (ignore the dots)

.0

.1 .0

.1 .1. 0

.3 .2. 1 0

10 .7. 3 1 0

43 30 13 4 1 0

...

(the zeros are then omitted)

CROSSREFS

Mirror image of triangle in A102473.

Adjacent sequences: A102469 A102470 A102471 this_sequence A102473 A102474 A102475

Sequence in context: A106338 A129964 A100100 this_sequence A101894 A116071 A077756

KEYWORD

easy,nonn,tabl

AUTHOR

Russell Walsmith (russw(AT)lycos.com), Jan 09 2005

EXTENSIONS

Entry revised by njas, Jul 09 2005

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 October 16 00:31 EDT 2008. Contains 145098 sequences.


AT&T Labs Research