Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A038759
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A038759 ceiling[sqrt(n)] * floor[sqrt(n)]. +0
3
0, 1, 2, 2, 4, 6, 6, 6, 6, 9, 12, 12, 12, 12, 12, 12, 16, 20, 20, 20, 20, 20, 20, 20, 20, 25, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 36, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 49, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 64, 72, 72, 72, 72, 72, 72, 72 (list; graph; listen)
OFFSET

0,3

COMMENT

a(n)=n iff n is a square or a pronic (or heteromecic) number of form k(k+1). The sequence interleaves individual squares with 2k copies of each pronic.

FORMULA

a(n) =A003059(n)*A000196(n) =n-A038760(n)

EXAMPLE

a(31)=30 since 6 and 5 are either side of the square root of 31 and 6*5=30

CROSSREFS

Cf. A002378, A053187.

Sequence in context: A078099 A118960 A107797 this_sequence A045999 A075569 A062722

Adjacent sequences: A038756 A038757 A038758 this_sequence A038760 A038761 A038762

KEYWORD

nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), May 03 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research