The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A340260 T(n, k) = Sum_{j=1..k} [n mod j <> 1], where [] is the Iverson bracket. Table read by rows. 2
1, 1, 2, 1, 1, 2, 1, 2, 2, 3, 1, 1, 2, 2, 3, 1, 2, 3, 4, 4, 5, 1, 1, 1, 2, 3, 3, 4, 1, 2, 3, 4, 5, 6, 6, 7, 1, 1, 2, 2, 3, 4, 5, 5, 6, 1, 2, 2, 3, 4, 5, 6, 7, 7, 8, 1, 1, 2, 3, 3, 4, 5, 6, 7, 7, 8, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 11, 1, 1, 1, 1, 2, 2, 3, 4, 5, 6, 7, 7, 8 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
EXAMPLE
Table starts:
[1] 1;
[2] 1, 2;
[3] 1, 1, 2;
[4] 1, 2, 2, 3;
[5] 1, 1, 2, 2, 3;
[6] 1, 2, 3, 4, 4, 5;
[7] 1, 1, 1, 2, 3, 3, 4;
[8] 1, 2, 3, 4, 5, 6, 6, 7;
[9] 1, 1, 2, 2, 3, 4, 5, 5, 6;
[10] 1, 2, 2, 3, 4, 5, 6, 7, 7, 8.
MAPLE
IversonBrackets := expr -> subs(true=1, false=0, evalb(expr)):
T := (n, k) -> add(IversonBrackets(irem(n, j) <> 1), j = 1..k):
for n from 1 to 19 do seq(T(n, k), k = 1..n) od;
CROSSREFS
T(n, n) = n + 1 - tau(n-1) for n >= 2.
Sequence in context: A243987 A050205 A281530 * A175190 A317685 A257540
KEYWORD
nonn,tabl
AUTHOR
Peter Luschny, Jan 02 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 19 13:16 EDT 2024. Contains 372694 sequences. (Running on oeis4.)