|
Search: id:A064801
|
|
|
| A064801 |
|
Take 1, skip 2, take 2, skip 3, take 3, etc. |
|
+0
4
|
|
| 1, 4, 5, 9, 10, 11, 16, 17, 18, 19, 25, 26, 27, 28, 29, 36, 37, 38, 39, 40, 41, 49, 50, 51, 52, 53, 54, 55, 64, 65, 66, 67, 68, 69, 70, 71, 81, 82, 83, 84, 85, 86, 87, 88, 89, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 121, 122, 123, 124, 125, 126, 127, 128
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
FORMULA
|
Can be interpreted as a table read by rows: T(n, k) = n^2 + k, 0<=k<n. T(n, k)=0 iff k > A000196(n); T(n, 0)=A000290(n); T(n, 1)=A002522(n) for n>1; T(n, 2)=A010000(n)=A059100(n) for n>2; T(n, n-3)=A014209(n-1) for n>2; T(n, n-2)=A028552(n) for n>1; T(n, n-1)=A028387(n-1); T(2*n+1, n)=A001107(n+1). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 18 2003
|
|
MATHEMATICA
|
a = Table[n, {n, 0, 200} ]; b = {}; Do[a = Drop[a, {1, n} ]; b = Append[b, Take[a, {1, n} ]]; a = Drop[a, {1, n} ], {n, 1, 14} ]; Flatten[b]
|
|
PROGRAM
|
(PARI) { n=0; for (m=1, 10^9, s=m^2; a=0; for (k=0, m - 1, a=s+k; write("b064801.txt", n++, " ", a); if (n==1000, return)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 26 2009]
|
|
CROSSREFS
|
Cf. A007606.
A004202(n) + 1.
Sequence in context: A116026 A115915 A007536 this_sequence A109825 A008935 A003995
Adjacent sequences: A064798 A064799 A064800 this_sequence A064802 A064803 A064804
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Oct 21 2001
|
|
|
Search completed in 0.002 seconds
|
