Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102298
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102298 Number of prime divisors with multiplicity of n+1 where n and n+1 are composite or twin composite numbers. +0
1
2, 2, 2, 4, 2, 2, 2, 2, 3, 3, 2, 2, 2, 4, 2, 4, 3, 2, 2, 3, 2, 3, 2, 4, 2, 2, 3, 6, 2, 3, 2, 3, 3, 3, 2, 3, 4, 2, 2, 2, 2, 4, 2, 3, 2, 2, 2, 6, 3, 4, 3, 2, 2, 5, 2, 3, 3, 2, 2, 5, 2, 2, 2, 3, 3, 4, 2, 3, 2, 2, 4, 4, 2, 2, 2, 6, 2, 2, 3, 3, 3, 3, 2, 4, 2, 6, 2, 5, 3, 2, 2, 3, 3, 3, 3, 5, 2, 2, 2, 4, 2, 3, 2, 3, 4 (list; graph; listen)
OFFSET

1,1

EXAMPLE

For n=8 n+1 = 9 = 3*3 or 2 prime divisors with multiplicity.

PROGRAM

(PARI) f(n) = for(x=1, n, y=composite(x)+1; if(!isprime(y), print1(bigomega(y)", "))) composite(n) =\The n-th composite number. 1 is def as not prime nor composite. { local(c, x); c=1; x=1; while(c <= n, x++; if(!isprime(x), c++); ); return(x) }

CROSSREFS

Sequence in context: A138260 A027387 A111735 this_sequence A049298 A075016 A102445

Adjacent sequences: A102295 A102296 A102297 this_sequence A102299 A102300 A102301

KEYWORD

easy,nonn

AUTHOR

Cino Hilliard (hillcino368(AT)gmail.com), Feb 19 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 19 21:04 EST 2009. Contains 171054 sequences.


AT&T Labs Research