|
Search: id:A014132
|
|
| |
|
| 2, 4, 5, 7, 8, 9, 11, 12, 13, 14, 16, 17, 18, 19, 20, 22, 23, 24, 25, 26, 27, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 46, 47, 48, 49, 50, 51, 52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 79, 80, 81, 82, 83
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Numbers that are not triangular.
Also definable as follows: a(1)=2; for n>1, a(n) is smallest integer greater than a(n-1) such that the condition "n and a(a(n)) have opposite parities" can always be satisfied. - Benoit Cloitre and Matthew Vandermast, Mar 10 2003
Comment from Alford Arnold (Alford1940(AT)aol.com), Oct 20 2006: May also be viewed as a triangular table beginning
2
4 5
7 8 9
11 12 13 14
16 17 18 19 20
...
|
|
LINKS
|
B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence (math.NT/0305308)
|
|
FORMULA
|
a(n) = n + round(sqrt(2*n)).
a(a(n)) = n + 2*[1/2 + sqrt(2n)] + 1, where [] is the integer part.
|
|
MATHEMATICA
|
f[n_] := n + Round[Sqrt[2n]]; Array[f, 71] (* or *)
Complement[ Range[83], Array[ #(# + 1)/2 &, 13]] (from Robert G. Wilson v (rgwv(at)rgwv.com), Oct 21 2005)
|
|
PROGRAM
|
(PARI) a(n)=if(n<1, 0, n+(sqrtint(8*n-7)+1)\2)
|
|
CROSSREFS
|
a(n)-a(n-1)= A035214(n)
Equals A080036 - 1.
Cf. A006002.
Sequence in context: A095042 A010423 A035235 this_sequence A047381 A097506 A001951
Adjacent sequences: A014129 A014130 A014131 this_sequence A014133 A014134 A014135
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
