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 11-14 of 14 results.

A267103 Row 3 of A265903; numbers that occur exactly three times in A004001.

Original entry on oeis.org

4, 15, 27, 30, 48, 54, 57, 61, 86, 96, 102, 105, 112, 115, 119, 124, 157, 172, 182, 188, 191, 202, 208, 211, 218, 221, 225, 233, 236, 240, 245, 251, 293, 314, 329, 339, 345, 348, 364, 374, 380, 383, 394, 400, 403, 410, 413, 417, 429, 435, 438, 445, 448, 452, 460, 463, 467, 472, 481, 484, 488, 493, 499, 506, 558
Offset: 1

Views

Author

Antti Karttunen, Jan 18 2016

Keywords

Comments

Numbers n for which A051135(n) = 3.

Links

Crossrefs

Column 3 of A265901, row 3 of A265903.
Cf. A004001, A051135, A087686, A188163, A266109.

Formula

a(n) = A087686(1+A266109(n)) = A087686(1+A087686(1+A188163(n))).

A095771 Number of times n appears in A095769.

Original entry on oeis.org

2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 3, 1, 2, 1, 1, 1, 1, 1, 1, 4, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 5, 1, 2, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
Offset: 1

Views

Author

Benoit Cloitre, Jun 05 2004

Keywords

Links

Crossrefs

Cf. A004001, A093878, A095769, A095770, A051135.

Programs

  • PARI
    v=vector(1000,j,1);for(n=3,1000,g=v[v[v[v[n-1]]]]+v[n-v[v[v[n-1]]]];v[n]=g);a(n)=sum(i=1,3*n,if(v[i]-n,0,1))

Formula

a(n) = card{ k in N : A095769(k)=n }.

A241235 a(n) = number of times n appears in A006949.

Original entry on oeis.org

3, 3, 1, 4, 1, 2, 1, 5, 1, 2, 1, 3, 1, 2, 1, 6, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 7, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 5, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 8, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 5, 1, 2, 1, 3, 1, 2
Offset: 1

Views

Author

Reinhard Zumkeller, Apr 17 2014

Keywords

Comments

Is this (with an exception at n=1) the same as A135560? - R. J. Mathar, Apr 26 2014

Links

Crossrefs

Cf. A051135.

Programs

  • Haskell
    a241235 n = a241235_list !! (n-1)
a241235_list = map length $ group a006949_list

A095772 Number of times n appears in A093878.

Original entry on oeis.org

2, 1, 2, 1, 2, 1, 2, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 4, 2, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 5, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 1, 1, 1, 1, 1, 6, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 5, 1, 1, 1, 1, 1, 1, 7, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
Offset: 1

Views

Author

Benoit Cloitre, Jun 05 2004

Keywords

Links

Crossrefs

Cf. A004001, A051135.

Programs

  • PARI
    v=vector(1000,j,1);for(n=3,1000,g=v[v[v[n-1]]]+v[n-v[v[n-1]]];v[n]=g);a(n)=sum(i=1,3*n,if(v[i]-n,0,1))

Formula

a(A000045(n)-1) = n-4 for n>4.
Previous Showing 11-14 of 14 results.

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

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