The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A057066 revision #9

A057066

a(n) = floor(4^4/n).

256, 128, 85, 64, 51, 42, 36, 32, 28, 25, 23, 21, 19, 18, 17, 16, 15, 14, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

LINKS

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

PROG

(PARI) a(n) = 4^4\n; \\ Seiichi Manyama, Aug 12 2023

CROSSREFS

Cf. A000007, A033324, A033347, A057067-A057075.

Sequence in context: A342039 A188830 A103949 * A186482 A186474 A093861

Adjacent sequences: A057063 A057064 A057065 * A057067 A057068 A057069

KEYWORD

nonn,easy

AUTHOR

Henry Bottomley, Jul 31 2000

STATUS

reviewed