|
Search: id:A092530
|
|
|
| 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. |
|
+0
2
|
|
| 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; listen)
|
|
|
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
|
|
PROGRAM
|
(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: A096186 A088901 A111302 this_sequence A154891 A139557 A103690
Adjacent sequences: A092527 A092528 A092529 this_sequence A092531 A092532 A092533
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Apr 08 2004
|
|
|
Search completed in 0.002 seconds
|
