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!)
A089967 Numbers n such that Omega(n) = gpf(n) mod spf(n), where Omega=A001222, gpf=A006530 and spf=A020639. 1

%I #5 Mar 30 2012 18:50:42

%S 1,15,33,35,51,69,85,87,123,141,143,159,161,177,185,213,235,249,259,

%T 267,303,321,323,325,335,339,393,411,447,455,485,501,519,533,535,537,

%U 553,573,575,591,635,681,685,699,715,717,749,753,771,785,789,805,807

%N Numbers n such that Omega(n) = gpf(n) mod spf(n), where Omega=A001222, gpf=A006530 and spf=A020639.

%C A069859(a(n)) = A001222(a(n));

%C A064900 is a subsequence.

%Y Cf. A089966.

%K nonn

%O 1,2

%A _Reinhard Zumkeller_, Nov 17 2003

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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)