id:A066935 - OEIS Search Results

Search: id:A066935

Displaying 1-1 of 1 results found.

page 1

bigomega(n+1)==0 (mod bigomega(n)) where bigomega(n)=A001222(n) is the number of prime divisors of n (counted with multiplicity).

+0
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; listen)

	OFFSET	`1,1`
	MATHEMATICA	`bigomega[n_] := Plus@@Last/@FactorInteger[n]; Select[Range[2, 150], Mod[bigomega[ #+1], bigomega[ # ]]==0&]`
	CROSSREFS	`Sequence in context: A061979 A050748 A079051 this_sequence A042943 A004274 A004280` `Adjacent sequences: A066932 A066933 A066934 this_sequence A066936 A066937 A066938`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 24 2002`
	EXTENSIONS	`Edited by Dean Hickerson (dean(AT)math.ucdavis.edu), Jan 27 2002`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research