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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064515 Write A064476(n) = 2^i(n)*3^j(n); sequence gives values of j(n). 3
0, 1, 1, 2, 2, 2, 3, 3, 3, 4, 3, 4, 4, 5, 4, 5, 4, 5, 6, 5, 6, 5, 6, 5, 7, 6, 7, 6, 7, 6, 8, 7, 6, 8, 7, 8, 7, 9, 8, 7, 9, 8, 7, 9, 8, 10, 9, 8, 10, 9, 8, 10, 9, 11, 8, 10, 9, 11, 10, 9, 11, 10, 12, 9, 11, 10, 12, 9, 11, 10, 12, 11, 13, 10, 12, 11, 13, 10, 12, 11, 13, 10, 12, 14, 11, 13, 12 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

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

PROG

(ARIBAS): function a064515(maxarg: integer); var j: integer; ar: array; begin ar := p2p3(maxarg); for j := 0 to maxarg - 1 do write(ar[j][2], " "); end; end; a064515(95). For definition of function p2p3 see A064476.

CROSSREFS

A064476, A064514.

Sequence in context: A080773 A134598 A325120 * A112754 A283467 A045864

Adjacent sequences:  A064512 A064513 A064514 * A064516 A064517 A064518

KEYWORD

nonn,easy

AUTHOR

Vladeta Jovovic, Oct 07 2001, Oct 07 2001

EXTENSIONS

More terms from Klaus Brockhaus, Oct 12 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 August 18 04:50 EDT 2019. Contains 326072 sequences. (Running on oeis4.)