Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A094396
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A094396 Numbers n such that n divides the (n-1)st Lucas number. +0
5
3, 4, 11476, 80476, 192676, 317683, 542242, 934876, 1339516, 4455676, 5063356, 7159636, 9004876, 9874684, 10134316, 17594242, 20558476 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

Do[If[Mod[Fibonacci[n-2] + Fibonacci[n], n] == 0, Print[n]], {n, 3, 100000}] (Propper)

CROSSREFS

Cf. A094397.

Sequence in context: A069970 A153063 A165499 this_sequence A161838 A152624 A059107

Adjacent sequences: A094393 A094394 A094395 this_sequence A094397 A094398 A094399

KEYWORD

more,nonn

AUTHOR

Eric S Rowland (erowland(AT)math.rutgers.edu), May 01 2004

EXTENSIONS

10 more terms from Ryan Propper (rpropper(AT)stanford.edu), Jun 21 2005

More terms from Ryan Propper (rpropper(AT)cs.stanford.edu), Jan 03 2008

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research