Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076518
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076518 Numbers n such that Fibonacci(n) == sigma(n) (mod n). +0
2
1, 2, 4, 11, 19, 29, 31, 41, 59, 61, 71, 79, 89, 101, 109, 120, 131, 139, 149, 151, 179, 181, 191, 199, 211, 229, 239, 241, 251, 269, 271, 281, 311, 331, 348, 349, 359, 379, 389, 401, 409, 419, 421, 431, 439, 449, 461, 479, 491, 499, 509, 521, 541, 569, 571 (list; graph; listen)
OFFSET

1,2

COMMENT

It appears that most of the terms of this sequence satisfy Fibonacci(n) == 1 (mod n). Also it seems that most of the terms are primes.

MATHEMATICA

Select[Range[10^4], Mod[Fibonacci[ # ], # ] == Mod[DivisorSigma[1, # ], # ] &]

CROSSREFS

Sequence in context: A056395 A053031 A018674 this_sequence A139785 A000638 A039824

Adjacent sequences: A076515 A076516 A076517 this_sequence A076519 A076520 A076521

KEYWORD

nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Oct 17 2002

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