|
Search: id:A076039
|
|
|
| A076039 |
|
Start with 1. Multiply or divide by n accordingly as a(n-1) is smaller or greater than n and then take the integer value (this is to ensure that a(n) >0 for all n). |
|
+0
4
|
|
| 1, 2, 6, 1, 5, 30, 4, 32, 3, 30, 2, 24, 1, 14, 210, 13, 221, 12, 228, 11, 231, 10, 230, 9, 225, 8, 216, 7, 203, 6, 186, 5, 165, 4, 140, 3, 111, 2, 78, 1, 41, 1722, 40, 1760, 39, 1794, 38, 1824, 37, 1850, 36, 1872, 35, 1890, 34, 1904, 33, 1914, 32, 1920, 31, 1922, 30, 1920
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
a(n) = n*a(n-1) if a(n-1) < n. a(n) = floor[a(n-1)/n] if a(n-1) is >= n.
a(A003462(k)) = 1. For A003462(k) < n <= A003462(k+1), if n-A003462(k) is odd, then a(n) = (3*A003462(k)+3-n)/2 and if n-A003462(k) is even, then a(n) = n*a(n-1). - David Wasserman (dwasserm(AT)earthlink.net), Mar 13 2005
|
|
EXAMPLE
|
a(13) = 1 hence a(14) = 14*1 = 14. 14< 15 hence a(15) = 14*15 = 210 >16 hence a(16) = Floor[210/16] = 13.
|
|
CROSSREFS
|
Cf. A003462, A076041, A076042, A046901.
Sequence in context: A154584 A129677 A077761 this_sequence A019576 A141906 A136766
Adjacent sequences: A076036 A076037 A076038 this_sequence A076040 A076041 A076042
|
|
KEYWORD
|
easy,nice,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Oct 29 2002
|
|
EXTENSIONS
|
More terms from David Wasserman (dwasserm(AT)earthlink.net), Mar 13 2005
|
|
|
Search completed in 0.002 seconds
|
