A285054 Numbers whose sum of digits are congruent (mod 10) to the string 1,2, ..., 9.

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 29, 20, 21, 22, 23, 24, 25, 26, 27, 38, 39, 30, 31, 32, 33, 34, 35, 36, 47, 48, 49, 40, 41, 42, 43, 44, 45, 56, 57, 58, 59, 50, 51, 52, 53, 54, 65, 66, 67, 68, 69, 60, 61, 62, 63, 74, 75, 76, 77, 78, 79, 70, 71, 72, 83

Offset

1,2

Comments

a(n) is the smallest term not yet in the sequences such that A007953(a(n)) == A010888(n) (mod 10). - R. J. Mathar, Oct 05 2017

Links

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

Example

The first string is 1,2,...,9; the second string goes from 10 to 18 since 1+0 is congruent to 1 (mod 10) and 1+8 is congruent to 9 (mod 10); the third string goes from 29 to 27 since 2+9 is congruent to 1 (mod 10) and 2+7 is congruent to 9 (mod 10), etc.

Maple

A285054 := proc(n)
    option remember;
    local a, i, known ;
    if n = 1 then
        1;
    else
        for a from 2 do
            known := false ;
            for i from 1 to n-1 do
                if procname(i) = a then
                    known := true;
                    break;
                end if;
            end do:
            if not known then
                if modp(digsum(a), 10) = A010888(n) then
                    return a;
                end if;
            end if;
        end do:
    end if;
end proc:
seq(A285054(n), n=1..200) ; # R. J. Mathar, Oct 05 2017

Crossrefs

Sequence in context: A269172 A302026 A358373 * A090322 A076084 A151764

Adjacent sequences: A285051 A285052 A285053 * A285055 A285056 A285057

Keyword

nonn,base

Author

Enrique Navarrete, Sep 11 2017

Status

approved