A092860 "3 times the prime sequence".

3, 4, 5, 6, 7, 10, 11, 12, 13, 16, 17, 18, 19, 22, 23, 28, 29, 30, 31, 36, 37, 40, 41, 42, 43, 46, 47, 52, 53, 58, 59, 60, 61, 66, 67, 70, 71, 72, 73, 78, 79, 82, 83, 88, 89, 96, 97, 100, 101, 102, 103, 106, 107, 108, 109, 112, 113, 126, 127, 130, 131, 136, 137, 138, 139

Offset

1,1

Comments

By iterating the addition to itself a monotonic sequence, according to the definition given in A092858, we can multiply the monotonic sequences by natural numbers.

Note, that it is easy to see that for an i natural and a v monotonic sequence, i(x)compl(v)=compl(i(x)v); where the "(x)" mark stands for the "integer multiplication of a sequence" and the function "compl" produces the complement of a positive monotonic sequence.

Links

Table of n, a(n) for n=1..65.

Ferenc Adorjan, Binary mapping of monotonic sequences and the Aronson function

Prog

(PARI) {imulv(i, v)= /*Returns "i (x) v" monotonic sequence */ return(mtinv(i*mt(v))) /* the functions mt(a) and mtinv(r) are defined in A051006 and A092855, respectively */ }

Crossrefs

Cf. A092855, A051006, A092857, A092858, A092859, A092861, A092862, A092863, A092874.

Sequence in context: A364083 A022555 A047308 * A351392 A112874 A159973

Adjacent sequences: A092857 A092858 A092859 * A092861 A092862 A092863

Keyword

easy,nonn

Author

Ferenc Adorjan (fadorjan(AT)freemail.hu)

Status

approved