Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105754
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105754 Lucas 8-step numbers. +0
6
1, 3, 7, 15, 31, 63, 127, 255, 502, 1003, 2003, 3999, 7983, 15935, 31807, 63487, 126719, 252936, 504869, 1007735, 2011471, 4014959, 8013983, 15996159, 31928831, 63730943, 127208950, 253913031, 506818327, 1011625183, 2019235407 (list; graph; listen)
OFFSET

1,2

REFERENCES

Tony D. Noe and Jonathan Vos Post, Primes in Fibonacci n-step and Lucas n-step Sequences, Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.4.

LINKS

T. D. Noe, Table of n, a(n) for n=1..200

Eric Weisstein's World of Mathematics, Lucas n-Step Number

FORMULA

a(n)=sum_{k=1..8} a(n-k) for n>0, a(0)=8, a(n)=-1 for n=-7..-1

MATHEMATICA

a={-1, -1, -1, -1, -1, -1, -1, 8}; Table[s=Plus@@a; a=RotateLeft[a]; a[[ -1]]=s, {n, 50}]

CROSSREFS

Cf. A000032, A001644, A073817, A074048, A074584, A104621, A105755 (Lucas n-step numbers).

Sequence in context: A043740 A116082 A043747 this_sequence A116690 A043755 A105755

Adjacent sequences: A105751 A105752 A105753 this_sequence A105755 A105756 A105757

KEYWORD

nonn

AUTHOR

T. D. Noe (noe(AT)sspectra.com), Apr 22 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 December 17 13:29 EST 2009. Contains 170826 sequences.


AT&T Labs Research