|
Search: id:A006844
|
|
|
| A006844 |
|
a(n) is smallest number which is uniquely a(j)+a(k), j<k (periodic mod 192).
(Formerly M3245)
|
|
+0
2
|
|
| 4, 5, 9, 13, 14, 17, 19, 21, 24, 25, 27, 35, 37, 43, 45, 47, 57, 67, 69, 73, 77, 83, 93, 101, 105, 109, 113, 115, 123, 125, 133, 149, 153, 163, 173, 197, 201, 205, 209, 211, 213, 217, 219, 227, 229, 235, 237, 239
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
An Ulam-type sequence - see A002858 for many further references, comments, etc. - T. D. Noe, Jan 21 2008
|
|
REFERENCES
|
S. R. Finch, Patterns in 1-additive sequences, Experimental Mathematics 1 (1992), 57-63.
S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 145-151.
R. K. Guy, ``s-Additive sequences,'' preprint, 1994.
R. K. Guy, Unsolved Problems in Number Theory, Section C4.
R. Queneau, Sur les suites s-additives, J. Combin. Theory, A12 (1972), 31-71.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
S. R. Finch, Stolarsky-Harborth Constant
Experimental Mathematics, Home Page
|
|
FORMULA
|
For n>9, a(n+32)=a(n)+192. - T. D. Noe, Jan 21 2008
|
|
CROSSREFS
|
Sequence in context: A060199 A078507 A034705 this_sequence A022425 A116045 A096818
Adjacent sequences: A006841 A006842 A006843 this_sequence A006845 A006846 A006847
|
|
KEYWORD
|
easy,nonn,nice
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
