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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A193365 a(n) = A220371(n)/(4*A220371(n-1)) 3
15, 126, 143, 1020, 399, 1150, 783, 8184, 1295, 3198, 1935, 9212, 2703, 6270, 3599, 65520, 4623, 10366, 5775, 25596, 7055, 15486, 8463, 73720, 9999, 21630, 11663, 50172, 13455, 28798, 15375, 524256, 17423, 36990 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

This sequence is, via A220371, related to A220002, which is related to the Catalan numbers.

Information about the peculiar structure of the a(n) can be found in A220466.

LINKS

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

FORMULA

a(n) = A220371(n)/(4*A220371(n-1))

a(2^p*(2*n-1)) = 2^p*(2^(2*p+4)*(2*n-1)^2-1), p >= 0.

MAPLE

nmax:= 34: for p from 0 to ceil(simplify(log[2](nmax))) do for n from 1 to ceil(nmax/(p+2)) do a(2^p*(2*n-1)) := 2^p*(2^(2*p+4)*(2*n-1)^2-1) od: od: seq(a(n), n=1..nmax);

PROG

(Sage)

def A193365_list(len):

    a = {}; z = 1; s = 0; p = 1

    while s < len:

        i = s; z += z

        while i < len:

            a[i] = p*((4*i+4)^2-1)

            i += z

        s += s + 1; p += p

    return [a[i] for i in range(len)]

A193365_list(30)  # Peter Luschny, Dec 22 2012

CROSSREFS

Cf. A220466

Sequence in context: A034271 A171220 A071080 * A069975 A027779 A073509

Adjacent sequences:  A193362 A193363 A193364 * A193366 A193367 A193368

KEYWORD

nonn,easy

AUTHOR

Johannes W. Meijer, Dec 21 2012

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 21 19:18 EDT 2019. Contains 323444 sequences. (Running on oeis4.)