login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A107800 a(n) = number of distinct primes dividing A006049(n) (and dividing (A006049(n)+1). 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; refs; listen; history; internal format)
OFFSET

1,6

COMMENTS

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 * A085761 A102382 A024890

Adjacent sequences:  A107797 A107798 A107799 * A107801 A107802 A107803

KEYWORD

nonn

AUTHOR

Leroy Quet, Mar 24 2007

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Mar 27 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 23:45 EST 2012. Contains 205978 sequences.