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!)
A067438 Number of distinct prime factors in floor((4/3)^n). 0
0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2, 2, 2, 2, 2, 3, 4, 3, 2, 3, 2, 3, 2, 2, 3, 2, 2, 4, 2, 3, 3, 2, 3, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 3, 3, 4, 3, 2, 2, 4, 3, 3, 3, 1, 4, 4, 3, 2, 2, 5, 6, 6, 5, 2, 4, 2, 2, 2, 3, 4, 3, 2, 4, 5, 5, 5, 4, 2, 3, 4, 4, 3, 5, 5, 4, 3, 4, 3, 3, 3, 1, 3, 3, 3, 4, 3, 3, 4, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,13

LINKS

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

MATHEMATICA

PrimeNu/@Floor[(4/3)^Range[110]] (* Harvey P. Dale, Nov 02 2011 *)

CROSSREFS

Sequence in context: A085398 A252503 A270003 * A178250 A174550 A119704

Adjacent sequences:  A067435 A067436 A067437 * A067439 A067440 A067441

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre, Feb 23 2002

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 May 28 21:37 EDT 2020. Contains 334690 sequences. (Running on oeis4.)