Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105755
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105755 Lucas 9-step numbers. +0
6
1, 3, 7, 15, 31, 63, 127, 255, 511, 1013, 2025, 4047, 8087, 16159, 32287, 64511, 128895, 257535, 514559, 1028105, 2054185, 4104323, 8200559, 16384959, 32737631, 65410751, 130692607, 261127679, 521740799, 1042453493, 2082852801 (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..9} a(n-k) for n>0, a(0)=9, a(n)=-1 for n=-8..-1

MATHEMATICA

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

CROSSREFS

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

Sequence in context: A105754 A116690 A043755 this_sequence A043764 A097002 A060152

Adjacent sequences: A105752 A105753 A105754 this_sequence A105756 A105757 A105758

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research