id:A107800 - OEIS Search Results

Search: id:A107800

Displaying 1-1 of 1 results found.

page 1

a(n) = number of distinct primes dividing A006049(n) (and dividing (A006049(n)+1).

+0
2

1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2 (list; graph; listen)

	OFFSET	`1,6`
	COMMENT	`a(n) first equals 3 when n is such that A006049(n) = 230.`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..2500`
	FORMULA	`a(n) = A001221(A006049(n)).`
	MATHEMATICA	`f[n_] := Length@FactorInteger[n]; t = f /@ Range[300]; f /@ Flatten@Position[Rest[t] - Most[t], 0] (Chandler)`
	CROSSREFS	`Cf. A001221, A006049, A052215.` `Sequence in context: A105446 A058978 A118916 this_sequence A085761 A102382 A024890` `Adjacent sequences: A107797 A107798 A107799 this_sequence A107801 A107802 A107803`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), Mar 24 2007`
	EXTENSIONS	`Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Mar 27 2007`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research