A185195 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A185195

Least k such that lambda(1) + lambda(2) +...+ lambda(k) >= n.

1, 2, 3, 3, 4, 4, 5, 5, 5, 5, 6, 6, 7, 7, 7, 7, 7, 7, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 17, 17, 17, 17

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

Lambda is the function in A002322.

LINKS

Robert Israel, Table of n, a(n) for n = 1..10000

EXAMPLE

a(3) = 3 because lambda(1) + lambda(2) + lambda(3) = 1+1+2 > 3.

MAPLE

with(numtheory):for n from 1 to 100 do:ii:=0:for k from 1 to 1000 while(ii=0) do: s:=sum(lambda(i), i=1..k):if s>=n then ii:=1: printf(`%d, `, k):else fi:od:od:

MATHEMATICA

a[n_] := (k = 1; While[ Total[ CarmichaelLambda[ Range[k]]] < n, k++]; k); Table[ a[n], {n, 1, 77}]

CROSSREFS

Cf. A002322, A038567.

Sequence in context: A375815 A073047 A038567 * A192512 A036234 A061091

Adjacent sequences: A185192 A185193 A185194 * A185196 A185197 A185198

KEYWORD

nonn

AUTHOR

Michel Lagneau, Jan 21 2012

STATUS

approved