login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A108142 a[1] = 1; a[2] = 1; a[3] = 1; a[4] = 1; a[5] = 1; a[6] = 1; for n >= 7, a[n] = 6*a[n - 1] - 5*a[n - 2] - 4*a[n - 3] - 3*a[ n - 4] + 2*a[n - 5] + a[n - 6]; then take absolute values. 0
1, 1, 1, 1, 1, 1, 3, 27, 151, 759, 3679, 17599, 83767, 397943, 1889059, 8964891, 42539855, 201849743, 957752095, 4544385823, 21562354767, 102309686479, 485441784803, 2303337053819, 10928934112423, 51855892302151 (list; graph; refs; listen; history; internal format)
OFFSET

1,7

COMMENTS

The 2nd countdown sequence.

REFERENCES

Roger Bagula, Factoring Double Fibonacci Sequences, 2000

MATHEMATICA

F[1] = 1; F[2] = 1; F[3] = 1; F[4] = 1; F[5] = 1; F[6] = 1; F[n__] := F[n] = 6*F[n - 1] - 5*F[n - 2] - 4*F[n - 3] - 3*F[ n - 4] + 2*F[n - 5] + F[n - 6] a = Table[Abs[F[n]], {n, 1, 50}]

CROSSREFS

Cf. A056015, A056016.

Sequence in context: A001796 A174613 A127509 * A056263 A026093 A129530

Adjacent sequences:  A108139 A108140 A108141 * A108143 A108144 A108145

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jun 05 2005

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Jun 08 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 10:05 EST 2012. Contains 206009 sequences.