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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081978 Smallest triangular number with n divisors, or 0 if no such number exists. 1
1, 3, 0, 6, 0, 28, 0, 66, 36, 496, 0, 276, 0, 378, 1631432881, 120, 0, 300, 0 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

a(p)=0 if p is an odd prime. If n is an odd composite number, then a(n) is a square; see A001110 for numbers that are both triangular and square. - Victoria Sapko (vsapko(AT)frc.mass.edu), Sep 28 2007

EXAMPLE

a(2)=3 because the smallest triangular number with 2 divisors is T(2)=3.

CROSSREFS

Cf. A081979.

Cf. A001110.

Sequence in context: A007386 A007385 A022899 * A117784 A197807 A111074

Adjacent sequences:  A081975 A081976 A081977 * A081979 A081980 A081981

KEYWORD

more,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 03 2003

EXTENSIONS

More terms from Victoria Sapko (vsapko(AT)frc.mass.edu), Sep 28 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 13:39 EST 2012. Contains 205802 sequences.