cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 51-60 of 79 results. Next

A120181 a(1)=4; a(n)=floor((27+sum(a(1) to a(n-1)))/6).

Original entry on oeis.org

4, 5, 6, 7, 8, 9, 11, 12, 14, 17, 20, 23, 27, 31, 36, 42, 49, 58, 67, 78, 91, 107, 124, 145, 169, 197, 230, 269, 313, 366, 427, 498, 581, 678, 791, 922, 1076, 1255, 1465, 1709
Offset: 1

Views

Author

Graeme McRae, Jun 10 2006

Keywords

Links

Crossrefs

Cf. A073941, A112088, A072493.

Programs

  • Mathematica
    nxt[{t_,a_}]:=Module[{c=Floor[(27+t)/6]},{t+c,c}]; NestList[nxt,{4,4},40][[All,2]] (* Harvey P. Dale, Nov 08 2022 *)

A120183 a(1)=6; a(n)=floor((41+sum(a(1) to a(n-1)))/6).

Original entry on oeis.org

6, 7, 9, 10, 12, 14, 16, 19, 22, 26, 30, 35, 41, 48, 56, 65, 76, 88, 103, 120, 140, 164, 191, 223, 260, 303, 354, 413, 482, 562, 656, 765, 892, 1041, 1215, 1417, 1653, 1929, 2250, 2625
Offset: 1

Views

Author

Graeme McRae, Jun 10 2006

Keywords

Links

Crossrefs

Cf. A073941, A112088, A072493.

Programs

  • Mathematica
    nxt[{t_,a_}]:=With[{c=Floor[(41+t)/6]},{t+c,c}]; NestList[nxt,{6,6},40][[;;,2]] (* Harvey P. Dale, Jul 12 2025 *)

A120185 a(1)=9; a(n)=floor((55+sum(a(1) to a(n-1)))/6).

Original entry on oeis.org

9, 10, 12, 14, 16, 19, 22, 26, 30, 35, 41, 48, 56, 65, 76, 89, 103, 121, 141, 164, 192, 224, 261, 304, 355, 414, 483, 564, 658, 767, 895, 1044, 1218, 1421, 1658, 1935, 2257, 2633, 3072, 3584
Offset: 1

Views

Author

Graeme McRae, Jun 10 2006

Keywords

Crossrefs

Cf. A073941, A112088, A072493.

A120190 a(1)=5; a(n)=floor((39+sum(a(1) to a(n-1)))/7).

Original entry on oeis.org

5, 6, 7, 8, 9, 10, 12, 13, 15, 17, 20, 23, 26, 30, 34, 39, 44, 51, 58, 66, 76, 86, 99, 113, 129, 147, 168, 192, 220, 251, 287, 328, 375, 429, 490, 560, 640, 731, 836, 955
Offset: 1

Views

Author

Graeme McRae, Jun 10 2006

Keywords

Links

Crossrefs

Cf. A073941, A112088, A072493.

Programs

  • Mathematica
    nxt[{s_,a_}]:=Module[{c=Floor[(39+s)/7]},{s+c,c}]; NestList[nxt,{5,5},40][[All,2]] (* Harvey P. Dale, Sep 13 2020 *)

A120193 a(1)=9; a(n)=floor((63+sum(a(1) to a(n-1)))/7).

Original entry on oeis.org

9, 10, 11, 13, 15, 17, 19, 22, 25, 29, 33, 38, 43, 49, 56, 64, 73, 84, 96, 109, 125, 143, 163, 187, 213, 244, 279, 318, 364, 416, 475, 543, 621, 709, 811, 927, 1059, 1210, 1383, 1581
Offset: 1

Views

Author

Graeme McRae, Jun 10 2006

Keywords

Links

Crossrefs

Cf. A073941, A112088, A072493.

Programs

  • Mathematica
    nxt[{s_,a_}]:=Module[{c=Floor[(63+s)/7]},{s+c,c}]; NestList[nxt,{9,9},40][[All,2]] (* Harvey P. Dale, Jul 29 2021 *)

A120199 a(1)=6; a(n)=floor((53+sum(a(1) to a(n-1)))/8).

Original entry on oeis.org

6, 7, 8, 9, 10, 11, 13, 14, 16, 18, 20, 23, 26, 29, 32, 36, 41, 46, 52, 58, 66, 74, 83, 93, 105, 118, 133, 150, 168, 189, 213, 240, 270, 303, 341, 384, 432, 486, 547, 615, 692, 778, 876, 985, 1108, 1247, 1403, 1578, 1775, 1997, 2247, 2528, 2844, 3199, 3599
Offset: 1

Views

Author

Graeme McRae, Jun 10 2006

Keywords

Links

Crossrefs

Cf. A073941, A112088, A072493.

Programs

  • Mathematica
    nxt[{t_,a_}]:=Module[{c=Floor[(53+t)/8]},{t+c,c}]; Transpose[ NestList[ nxt,{6,6},60]][[2]] (* Harvey P. Dale, Jan 05 2016 *)

Extensions

More terms from Harvey P. Dale, Jan 05 2016

A120200 a(1)=7; a(n)=floor((62+sum(a(1) to a(n-1)))/8).

Original entry on oeis.org

7, 8, 9, 10, 12, 13, 15, 17, 19, 21, 24, 27, 30, 34, 38, 43, 48, 54, 61, 69, 77, 87, 98, 110, 124, 139, 157, 176, 198, 223, 251, 282, 317, 357, 402, 452, 508, 572, 643, 724
Offset: 1

Views

Author

Graeme McRae, Jun 10 2006

Keywords

Links

Crossrefs

Cf. A073941, A112088, A072493.

Programs

  • Maple
    R:= 7:
s:= 7:
for n from 2 to 100 do
  v:= floor((62 + s)/8);
  R:= R,v;
  s:= s+v
od:
R; # Robert Israel, Sep 18 2024

A120201 a(1)=8; a(n)=floor((71+sum(a(1) to a(n-1)))/8).

Original entry on oeis.org

8, 9, 11, 12, 13, 15, 17, 19, 21, 24, 27, 30, 34, 38, 43, 49, 55, 62, 69, 78, 88, 99, 111, 125, 141, 158, 178, 200, 225, 253, 285, 321, 361, 406, 457, 514, 578, 650, 731, 823, 926, 1041, 1172, 1318, 1483, 1668, 1877, 2111, 2375, 2672, 3006, 3382, 3805, 4280
Offset: 1

Views

Author

Graeme McRae, Jun 10 2006

Keywords

Links

Crossrefs

Cf. A073941, A112088, A072493.

Programs

  • Mathematica
    nxt[{s_,a_}]:=Module[{c=Floor[(s+71)/8]},{s+c,c}]; NestList[nxt,{8,8},50][[All,2]] (* Harvey P. Dale, May 04 2017 *)

Extensions

More terms from Harvey P. Dale, May 04 2017

A120203 a(1) = 2; a(n) = floor( (19 + Sum_{i=1..n-1} a(i)) /9).

Original entry on oeis.org

2, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 6, 7, 7, 8, 9, 10, 11, 12, 14, 15, 17, 19, 21, 23, 26, 29, 32, 36, 40, 44, 49, 54, 60, 67, 74, 83, 92, 102, 113, 126, 140, 156, 173, 192, 213, 237, 263, 293, 325, 361, 401, 446, 496, 551, 612
Offset: 1

Views

Author

Graeme McRae, Jun 10 2006

Keywords

Crossrefs

Cf. A073941, A112088, A072493.

Programs

  • Maple
    A120203 := proc(n)
    option remember;
    if n = 1 then
        2;
    else
        floor( (19+ add(procname(i),i=1..n-1))/9) ;
    end if;
end proc: # R. J. Mathar, Jul 12 2012
  • Mathematica
    f[s_] := Append[s, Floor[(19 + Plus @@ s)/9]]; Nest[f, {2}, 60] (* Robert G. Wilson v, Jul 08 2006 *)

A120204 a(1) = 3; a(n) = floor((29 + Sum_{i=1..n-1} a(i))/9).

Original entry on oeis.org

3, 3, 3, 4, 4, 5, 5, 6, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 18, 20, 23, 25, 28, 31, 35, 38, 43, 47, 53, 59, 65, 72, 80, 89, 99, 110, 122, 136, 151, 168, 186, 207, 230, 256, 284, 316, 351, 390, 433, 481, 535, 594, 660, 733, 815, 905, 1006, 1118, 1242, 1380, 1533
Offset: 1

Views

Author

Graeme McRae, Jun 10 2006

Keywords

Links

Crossrefs

Cf. A073941, A112088, A072493.

Programs

  • Mathematica
    a[1]:=3; a[n_]:=a[n]=Floor[(29+Sum[a[i],{i,n-1}])/9]; Array[a,61] (* Stefano Spezia, Jul 19 2024 *)

Extensions

a(41)-a(61) from Stefano Spezia, Jul 19 2024
Previous Showing 51-60 of 79 results. Next

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.