Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A159052
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A159052
%S A159052 1,1037,1157,20737,250973,854813,1055617,4042469,8588477
%N A159052 Odd terms in A159051.
%t A159052 lst={};Do[If[Mod[(Fibonacci[n-2]),n]==0,If[OddQ[n],AppendTo[lst,n]]],
               {n,3*8!}];lst
%t A159052 a = c = 0; b = 1; lst = {}; Do[c = a + b; If[ Mod[a, n] == 0 && OddQ@n, 
               Print@n]; a = b; b = c, {n, 2, 10^7}] [From Robert G. Wilson v (rgwv(AT)rgwv.com), 
               Apr 05 2009]
%Y A159052 Cf. A123976, A159051
%Y A159052 Sequence in context: A025409 A043388 A163559 this_sequence A065572 A074673 
               A020395
%Y A159052 Adjacent sequences: A159049 A159050 A159051 this_sequence A159053 A159054 
               A159055
%K A159052 nonn
%O A159052 1,2
%A A159052 Vladimir Orlovsky (4vladimir(AT)gmail.com), Apr 03 2009
%E A159052 a(5) - a(9) from Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 05 2009
%E A159052 Edited by N. J. A. Sloane, Apr 06 2009

    
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