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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A092530 a(0) = 0; for n>0, a(n) = T(n) + k where T(n) is a triangular number (A000217) and k (see A026741) is the smallest positive number such that a(n) is divisible by n. 1
0, 2, 4, 9, 12, 20, 24, 35, 40, 54, 60, 77, 84, 104, 112, 135, 144, 170, 180, 209, 220, 252, 264, 299, 312, 350, 364, 405, 420, 464, 480, 527, 544, 594, 612, 665, 684, 740, 760, 819, 840, 902, 924, 989, 1012, 1080, 1104, 1175, 1200, 1274, 1300, 1377, 1404, 1484 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

REFERENCES

A. W. Vyawahare and K. M. Purohit, Near pseudo Smarandache function, Smarandache Notions, 14 (2004), 42-61.

FORMULA

a(0) = 0, a(2n) = a(2n-1) + n, a(2n-1) = a(2n-2) + 3n-1. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 04 2004

MAPLE

seq(n*(1+ceil(n/2)), n=0..53); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com) and Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Apr 10 2007

PROG

(PARI) for(n=0, 53, print1(n*(1+ceil(n/2)), ", ")); - Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Apr 10 2007

CROSSREFS

Equals A000217 + A026741.

Sequence in context: A182859 A088901 A111302 * A154891 A176472 A139557

Adjacent sequences:  A092527 A092528 A092529 * A092531 A092532 A092533

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Apr 08 2004

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 17 12:38 EST 2012. Contains 206021 sequences.