Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101400
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101400 a(n) = a(n - 1) + 2*a(n - 2) + a(n - 3) - a(n - 4) +0
5
1, 2, 5, 10, 21, 44, 91, 190, 395, 822, 1711, 3560, 7409, 15418, 32085, 66770, 138949, 289156, 601739, 1252230, 2605915, 5422958, 11285279, 23484880, 48872481, 101704562, 211649125, 440445850, 916576181, 1907412444, 3969361531 (list; graph; listen)
OFFSET

0,2

COMMENT

Lengths of successive words (starting with a) under the substitution: {a -> ab, b -> aac, c -> d, d -> b}.

EXAMPLE

a(0) = 1, a(1) = 2, a(2) = 5, a(3) = 10, a(4) = 21, a(5) = 44

MATHEMATICA

a[0] = 1; a[1] = 2; a[2] = 5; a[3] = 10; a[n_] := a[n] = a[n - 1] + 2a[n - 2] + a[n - 3] - a[n - 4]; Table[ a[n], {n, 0, 30}] (from Robert G. Wilson v Jan 15 2005)

CROSSREFS

Cf. A092886, A105309.

Sequence in context: A101510 A066819 A114279 this_sequence A131403 A052540 A018106

Adjacent sequences: A101397 A101398 A101399 this_sequence A101401 A101402 A101403

KEYWORD

nonn,easy

AUTHOR

J. F. J. Laros (jlaros(AT)liacs.nl), Jan 15 2005

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 15 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research