login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A120251 A120249[n] modulo A120250[n]. 2

%I #1 Sep 29 2006 03:00:00

%S 0,0,1,0,2,1,3,0,1,2,5,1,8,3,2,0,13,1,21,2,3,5,34,1,3,8,1,3,55,2,89,0,

%T 5,13,5,1,144,21,8,2,233,3,377,5,2,34,610,1,4,3,13,8,987,1,8,3,21,55,

%U 1597,2,2584,89,3,0,13,5,4181,13,34,5,6765,1,10946,144,3,21,7,8,17711,2

%N A120249[n] modulo A120250[n].

%C a[n] = 0 precisely when n is a power of 2.

%F a[n] = Mod[A120249[n], A120250[n]]

%e a[n] = A120249[2646] modulo A120250[2646] = 42 modulo 19 = 4

%t Table[If[n == 1, 0, (fl = FactorInteger[n]; pq = Table[1, {i, 1, PrimePi[Last[fl][[1]]]}]; While[Length[fl] > 0, pp = First[fl]; fl = Drop[fl, 1]; pq[[PrimePi[pp[[1]]]]] = pp[[2]] + 1;]; Mod[Numerator[FromContinuedFraction[pq]], Denominator[FromContinuedFraction[pq]]])], {n, 1, 80}]

%Y Cf. Corresponding denominators in A120250.

%K frac,hard,nonn

%O 1,5

%A Joseph Biberstine (jrbibers(AT)indiana.edu), Jun 12 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)