| 3, 12, 16, 22, 31, 40, 44, 53, 57, 63, 72, 76, 82, 91, 100, 104, 110, 119, 128, 132, 141, 145, 151, 160, 169, 173, 182, 186, 192, 201, 205, 211, 220, 229, 233, 242, 246, 252, 261, 265, 271, 280, 289, 293, 299, 308, 317, 321, 330, 334, 340, 349, 353, 359, 368
(list; graph; listen)
|
|
|
OFFSET
|
3,1
|
|
|
FORMULA
|
Any number n has a unique representation as a sum of terms from {3, 4, 6, 9, 13, 19, ...} (cf. A000930) such that no two terms are adjacent or pen-adjacent; e.g. 12=9+3. Sequence gives all n where that representation involves 3.
|
|
CROSSREFS
|
Cf. A020942.
Sequence in context: A096854 A013191 A009783 this_sequence A022411 A115229 A136047
Adjacent sequences: A064103 A064104 A064105 this_sequence A064107 A064108 A064109
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Naohiro Nomoto (n_nomoto(AT)yabumi.com), Sep 17 2001
|
|
