|
| |
|
|
A033627
|
|
0-additive sequence: not the sum of any previous pair.
|
|
22
| |
|
|
1, 2, 4, 7, 10, 13, 16, 19, 22, 25, 28, 31, 34, 37, 40, 43, 46, 49, 52, 55, 58, 61, 64, 67, 70, 73, 76, 79, 82, 85, 88, 91, 94, 97, 100, 103, 106, 109, 112, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 175
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
REFERENCES
| R. K. Guy, Unsolved Problems in Number Theory, C4
|
|
|
LINKS
| Reinhard Zumkeller, Table of n, a(n) for n = 1..1000
Eric Weisstein's World of Mathematics, Stohr Sequence.
|
|
|
FORMULA
| 2 together with numbers of form 3k+1.
Equals binomial transform of [1, 1, 1, 0, -1, 2, -3, 4, -5, 6, -7,...]. Equals sum of antidiagonal terms of the following arithmetic array: 1, 1, 1, 1, 1,... 1, 2, 3, 4, 5,... 1, 3, 5, 7, 9,... - Gary W. Adamson (qntmpkt(AT)yahoo.com), May 10 2008
|
|
|
MATHEMATICA
| Join[{1, 2}, Range[4, 200, 3]] (* From Vladimir Joseph Stephan Orlovsky, Jan 27 2012 *)
|
|
|
PROG
| (Haskell)
import Data.List ((\\))
a033627 n = a033627_list !! (n-1)
a033627_list = f [1..] [] where
f (x:xs) ys = x : f (xs \\ (map (+ x) ys)) (x:ys)
-- Reinhard Zumkeller, Jan 11 2012
|
|
|
CROSSREFS
| Cf. A002858.
Cf. A016777. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 22 2008]
Sequence in context: A122019 A190279 A186325 * A066512 A135678 A001195
Adjacent sequences: A033624 A033625 A033626 * A033628 A033629 A033630
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Jud McCranie (JudMcCranie(AT)ugaalum.uga.edu)
|
| |
|
|
