Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079506
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079506 Numbers n with gcd(2^n-1,fibonacci(n))>1 and not divisible by 2 or 11. Odd members of A074776 not divisible by 11. +0
4
261, 305, 333, 377, 525, 651, 753, 783, 895, 915, 999, 1131, 1305, 1475, 1525, 1575, 1665, 1827, 1885, 1953, 2135, 2235, 2259, 2265, 2283, 2319, 2331, 2349, 2515, 2601, 2625, 2639, 2685, 2743, 2745, 2867, 2921, 2975, 2997, 3255, 3393, 3549, 3675, 3765 (list; graph; listen)
OFFSET

1,1

EXAMPLE

Example: gcd(2^261-1,fibonacci(261))=2089 and 11 does not divide 261, so 261 is in sequence.

PROGRAM

(PARI) for(k=1, 5000, if(gcd(2^k-1, fibonacci(k))>1, if(k%2, if(k%11, print1(k", ")))))

CROSSREFS

Cf. A074776.

Sequence in context: A045026 A131071 A131062 this_sequence A028527 A014569 A063364

Adjacent sequences: A079503 A079504 A079505 this_sequence A079507 A079508 A079509

KEYWORD

nonn

AUTHOR

Ralf Stephan (ralf(AT)ark.in-berlin.de), Jan 21 2003

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 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research