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!)
A063173 Prime-composite array T(m,n): highest power of the n-th prime that divides the n-th composite, read by antidiagonals. 5
2, 1, 0, 3, 1, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..105.

N. Fernandez, The prime-composite array B(m,n) and the Borve conjectures

EXAMPLE

Let p(n) be the n-th prime and c(m) the m-th composite. T(1,1)=2 because c(1)=4, p(1)=2 and the highest power of 2 in 4 is 2^2. T(1,2)=0 because c(1)=4, p(2)=3 and the highest power of 3 in 4 is 3^0. T(2,1)=1 because c(2)=6, p(1)=2 and the highest power of 2 in 6 is 2^1. So the sequence starts 2,0,1,...

Array begins

2 0 0 0 0 0 0 ...

1 1 0 0 0 0 0 ...

3 0 0 0 0 0 0 ...

0 2 0 0 0 0 0 ...

1 0 1 0 0 0 0 ...

CROSSREFS

Cf. A000040, A002808, A063174, A063175, A063176.

Sequence in context: A004172 A238942 A082754 * A120111 A130055 A202452

Adjacent sequences:  A063170 A063171 A063172 * A063174 A063175 A063176

KEYWORD

nonn,tabl

AUTHOR

Neil Fernandez, Jul 09 2001

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 September 29 05:48 EDT 2020. Contains 337425 sequences. (Running on oeis4.)