login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066935 bigomega(n+1)==0 (mod bigomega(n)) where bigomega(n)=A001222(n) is the number of prime divisors of n (counted with multiplicity). 1
2, 3, 5, 7, 9, 11, 13, 14, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 34, 35, 37, 38, 39, 41, 43, 44, 47, 53, 55, 57, 59, 61, 63, 67, 71, 73, 75, 79, 83, 85, 86, 87, 89, 93, 94, 95, 97, 98, 101, 103, 107, 109, 113, 116, 118, 121, 122, 124, 127, 131, 133, 134, 135, 137, 139 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Harry J. Smith, Table of n, a(n) for n = 1..1000

MATHEMATICA

bigomega[n_] := Plus@@Last/@FactorInteger[n]; Select[Range[2, 150], Mod[bigomega[ #+1], bigomega[ # ]]==0&]

PROG

(PARI) { n=0; for (m=2, 10^10, if (bigomega(m+1) % bigomega(m) == 0, write("b066935.txt", n++, " ", m); if (n==1000, return)) ) } \\ Harry J. Smith, Apr 08 2010

CROSSREFS

Sequence in context: A050748 A079051 A226047 * A042943 A306466 A258037

Adjacent sequences:  A066932 A066933 A066934 * A066936 A066937 A066938

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Jan 24 2002

EXTENSIONS

Edited by Dean Hickerson, Jan 27 2002

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 21 04:10 EDT 2021. Contains 345354 sequences. (Running on oeis4.)