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.

Showing 1-10 of 23 results. Next

A190486 Positions of 2 in A190483.

Original entry on oeis.org

2, 7, 12, 14, 19, 24, 31, 36, 41, 43, 48, 53, 60, 65, 70, 72, 77, 82, 84, 89, 94, 101, 106, 111, 113, 118, 123, 130, 135, 140, 142, 147, 152, 159, 164, 171, 176, 181, 183, 188, 193, 200, 205, 210, 212, 217, 222, 229, 234, 239, 241, 246, 251, 253, 258, 263, 270, 275, 280, 282, 287, 292, 299, 304, 309, 311, 316
Offset: 1

Views

Author

Clark Kimberling, May 11 2011

Keywords

Comments

See A190483.

Links

Crossrefs

Cf. A190483, A190484, A190485.

Programs

  • Mathematica
    r = Sqrt[2]; b = 2; c = 1;
f[n_] := Floor[(b*n + c)*r] - b*Floor[n*r] - Floor[c*r];
t = Table[f[n], {n, 1, 200}]  (* A190483 *)
Flatten[Position[t, 0]]   (* A190484 *)
Flatten[Position[t, 1]]   (* A190485 *)
Flatten[Position[t, 2]]   (* A190486 *)
  • Python
    from sympy import sqrt, floor
r=sqrt(2)
def a190483(n): return floor((2*n + 1)*r) - 2*floor(n*r) - floor(r)
print([n for n in range(1, 501) if a190483(n)==2]) # Indranil Ghosh, Jul 02 2017

A190484 Positions of 0 in A190483.

Original entry on oeis.org

3, 5, 10, 15, 17, 20, 22, 27, 29, 32, 34, 39, 44, 46, 51, 56, 58, 61, 63, 68, 73, 75, 80, 85, 87, 90, 92, 97, 99, 102, 104, 109, 114, 116, 119, 121, 126, 128, 131, 133, 138, 143, 145, 150, 155, 157, 160, 162, 167, 169, 172, 174, 179, 184, 186, 189, 191, 196, 198, 201, 203, 208, 213, 215
Offset: 1

Views

Author

Clark Kimberling, May 11 2011

Keywords

Comments

See A190483.

Links

Crossrefs

Cf. A190483.

Programs

  • Mathematica
    r = Sqrt[2]; b = 2; c = 1;
f[n_] := Floor[(b*n + c)*r] - b*Floor[n*r] - Floor[c*r];
t = Table[f[n], {n, 1, 200}]  (* A190483 *)
Flatten[Position[t, 0]]   (* A190484 *)
Flatten[Position[t, 1]]   (* A190485 *)
Flatten[Position[t, 2]]   (* A190486 *)
  • Python
    from sympy import sqrt, floor
r=sqrt(2)
def a190483(n): return floor((2*n + 1)*r) - 2*floor(n*r) - floor(r)
print([n for n in range(1, 501) if a190483(n)==0]) # Indranil Ghosh, Jul 02 2017

A190485 Positions of 1 in A190483.

Original entry on oeis.org

1, 4, 6, 8, 9, 11, 13, 16, 18, 21, 23, 25, 26, 28, 30, 33, 35, 37, 38, 40, 42, 45, 47, 49, 50, 52, 54, 55, 57, 59, 62, 64, 66, 67, 69, 71, 74, 76, 78, 79, 81, 83, 86, 88, 91, 93, 95, 96, 98, 100, 103, 105, 107, 108, 110, 112, 115, 117, 120, 122, 124, 125, 127, 129, 132, 134, 136, 137, 139, 141, 144, 146, 148, 149, 151, 153, 154, 156, 158
Offset: 1

Views

Author

Clark Kimberling, May 11 2011

Keywords

Comments

See A190483.

Links

Crossrefs

Cf. A190483, A190485, A190486.

Programs

  • Mathematica
    r = Sqrt[2]; b = 2; c = 1;
f[n_] := Floor[(b*n + c)*r] - b*Floor[n*r] - Floor[c*r];
t = Table[f[n], {n, 1, 200}]  (* A190483 *)
Flatten[Position[t, 0]]   (* A190484 *)
Flatten[Position[t, 1]]   (* A190485 *)
Flatten[Position[t, 2]]   (* A190486 *)
  • Python
    from sympy import sqrt, floor
r=sqrt(2)
def a190483(n): return floor((2*n + 1)*r) - 2*floor(n*r) - floor(r)
print([n for n in range(1, 501) if a190483(n)==1]) # Indranil Ghosh, Jul 02 2017

A190487 a(n) = [(bn+c)r]-b[nr]-[cr], where (r,b,c)=(sqrt(2),3,0) and []=floor.

Original entry on oeis.org

1, 2, 0, 1, 0, 1, 2, 0, 2, 0, 1, 2, 1, 2, 0, 1, 0, 1, 2, 0, 2, 0, 1, 2, 1, 2, 0, 1, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0, 1, 2, 1, 2, 0, 1, 0, 1, 2, 0, 2, 0, 1, 2, 1, 2, 0, 1, 0, 1, 2, 0, 2, 0, 1, 2, 1, 2, 0, 1, 2, 1, 2, 0, 1, 0, 1, 2, 0, 2, 0, 1, 2, 1, 2, 0, 1, 0, 1, 2, 0, 2, 0, 1, 2, 1, 2, 0, 1, 0, 1, 2, 0, 1, 0, 1, 2, 0, 2, 0, 1, 2, 1, 2, 0, 1, 0, 1, 2, 0, 2, 0, 1, 2, 1, 2, 0, 1, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0
Offset: 1

Views

Author

Clark Kimberling, May 11 2011

Keywords

Comments

Write a(n) = [(bn+c)r]-b[nr]-[cr]. If r>0 and b and c are integers satisfying b>=2 and 0<=c<=b-1, then 0<=a(n)<=b. The positions of 0 in the sequence a are of interest, as are the position sequences for 1,2,...,b. These b+1 position sequences comprise a partition of the positive integers.
Examples:
(golden ratio,2,1): A190427-A190430
(sqrt(2),2,0): A190480
(sqrt(2),2,1): A190483-A190486
(sqrt(2),3,0): A190487-A190490
(sqrt(2),3,1): A190491-A190495
(sqrt(2),3,2): A190496-A190500

Links

Crossrefs

Cf. A190488, A190489, A190490.

Programs

  • Mathematica
    r = Sqrt[2]; b = 3; c = 0;
f[n_] := Floor[(b*n + c)*r] - b*Floor[n*r] - Floor[c*r];
t = Table[f[n], {n, 1, 200}]  (* A190487 *)
Flatten[Position[t, 0]]   (* A190488 *)
Flatten[Position[t, 1]]   (* A190489 *)
Flatten[Position[t, 2]]   (* A190490 *)

A190491 a(n) = [(bn+c)r]-b[nr]-[cr], where (r,b,c)=(sqrt(2),3,1) and []=floor.

Original entry on oeis.org

1, 2, 1, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 2, 1, 2, 0, 1, 3, 1, 2, 0, 1, 3, 1, 2, 0, 2, 0, 1, 2, 1, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 2, 1, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 2, 1, 2, 0, 1, 2, 1, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 2, 1, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 2, 1, 2, 0, 1, 3, 1, 2, 0, 1, 3, 1, 2, 0, 2, 0, 1, 2, 1, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 2, 1, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 2, 0, 2, 0
Offset: 1

Views

Author

Clark Kimberling, May 11 2011

Keywords

Comments

Write a(n)=[(bn+c)r]-b[nr]-[cr]. If r>0 and b and c are integers satisfying b>=2 and 0<=c<=b-1, then 0<=a(n)<=b. The positions of 0 in the sequence a are of interest, as are the position sequences for 1,2,...,b. These b+1 position sequences comprise a partition of the positive integers.
Examples:
(golden ratio,2,1): A190427-A190430
(sqrt(2),2,0): A190480, A120743, A170749
(sqrt(2),2,1): A190483-A190486
(sqrt(2),3,0): A190487-A190490
(sqrt(2),3,1): A190491-A190495
(sqrt(2),3,2): A190496-A190500

Links

Crossrefs

Cf. A190492, A190493, A190494, A190495.

Programs

  • Mathematica
    r = Sqrt[2]; b = 3; c = 1;
f[n_] := Floor[(b*n + c)*r] - b*Floor[n*r] - Floor[c*r];
t = Table[f[n], {n, 1, 200}]  (* A190491 *)
Flatten[Position[t, 0]]   (* A190492 *)
Flatten[Position[t, 1]]   (* A190493 *)
Flatten[Position[t, 2]]   (* A190494 *)
Flatten[Position[t, 3]]   (* A190495 *)

A190496 a(n) = [(bn+c)r]-b[nr]-[cr], where (r,b,c)=(sqrt(2),3,2) and []=floor.

Original entry on oeis.org

2, 3, 1, 2, 1, 2, 3, 1, 3, 1, 2, 3, 1, 3, 1, 2, 0, 2, 3, 1, 2, 1, 2, 3, 1, 3, 1, 2, 0, 2, 3, 1, 2, 1, 2, 3, 1, 3, 1, 2, 3, 2, 3, 1, 2, 0, 2, 3, 1, 2, 1, 2, 3, 1, 3, 1, 2, 0, 2, 3, 1, 2, 1, 2, 3, 1, 3, 1, 2, 3, 2, 3, 1, 2, 1, 2, 3, 1, 2, 1, 2, 3, 1, 3, 1, 2, 0, 2, 3, 1, 2, 1, 2, 3, 1, 3, 1, 2, 0, 2, 3, 1, 2, 1, 2, 3, 1, 3, 1, 2, 3, 2, 3, 1, 2, 0, 2, 3, 1, 2, 1, 2, 3, 1, 3, 1, 2, 0
Offset: 1

Views

Author

Clark Kimberling, May 11 2011

Keywords

Comments

Write a(n)=[(bn+c)r]-b[nr]-[cr]. If r>0 and b and c are integers satisfying b>=2 and 0<=c<=b-1, then 0<=a(n)<=b. The positions of 0 in the sequence a are of interest, as are the position sequences for 1,2,...,b. These b+1 position sequences comprise a partition of the positive integers.
Examples:
(golden ratio,2,1): A190427-A190430
(sqrt(2),2,0): A190480
(sqrt(2),2,1): A190483-A190486
(sqrt(2),3,0): A190487-A190490
(sqrt(2),3,1): A190491-A190495
(sqrt(2),3,2): A190496-A190500

Links

Crossrefs

Cf. A190497, A190498, A190499, A190500.

Programs

  • Mathematica
    r = Sqrt[2]; b = 3; c = 2;
f[n_] := Floor[(b*n + c)*r] - b*Floor[n*r] - Floor[c*r];
t = Table[f[n], {n, 1, 200}]  (* A190496 *)
Flatten[Position[t, 0]]   (* A190497 *)
Flatten[Position[t, 1]]   (* A190498 *)
Flatten[Position[t, 2]]   (* A190499 *)
Flatten[Position[t, 3]]   (* A190500 *)

A190544 a(n) = [(bn+c)r]-b[nr]-[cr], where (r,b,c)=(sqrt(2),4,0) and []=floor.

Original entry on oeis.org

1, 3, 0, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 0, 1, 3, 1, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 3, 1, 3, 0, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 0, 1, 3, 0, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 0
Offset: 1

Views

Author

Clark Kimberling, May 12 2011

Keywords

Comments

Write a(n)=[(bn+c)r]-b[nr]-[cr]. If r>0 and b and c are integers satisfying b>=2 and 0<=c<=b-1, then 0<=a(n)<=b. The positions of 0 in the sequence a are of interest, as are the position sequences for 1,2,...,b. These b+1 position sequences comprise a partition of the positive integers.
Examples:
(golden ratio,2,1): A190427-A190430
(sqrt(2),2,0): A190480
(sqrt(2),2,1): A190483-A190486
(sqrt(2),3,0): A190487-A190490
(sqrt(2),3,1): A190491-A190495
(sqrt(2),3,2): A190496-A190500
(sqrt(2),4,c): A190544-A190566

Links

Crossrefs

Cf. A190545, A190546, A190547, A190548.

Programs

  • Mathematica
    r = Sqrt[2]; b = 4; c = 0;
f[n_] := Floor[(b*n + c)*r] - b*Floor[n*r] - Floor[c*r];
t = Table[f[n], {n, 1, 200}] (* A190544 *)
Flatten[Position[t, 0]]      (* A190545 *)
Flatten[Position[t, 1]]      (* A190546 *)
Flatten[Position[t, 2]]      (* A190547 *)
Flatten[Position[t, 3]]      (* A190548 *)

Formula

a(n) = [4nr] - 4*[nr], where r=sqrt(2).

A190549 a(n) = [(bn+c)r]-b[nr]-[cr], where (r,b,c)=(sqrt(2),4,1) and []=floor.

Original entry on oeis.org

2, 3, 1, 3, 0, 2, 4, 1, 3, 0, 2, 4, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 4, 2, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 4, 2, 3, 1, 3, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 4, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3
Offset: 1

Views

Author

Clark Kimberling, May 12 2011

Keywords

Comments

Write a(n) = [(bn+c)r]-b[nr]-[cr]. If r>0 and b and c are integers satisfying b>=2 and 0<=c<=b-1, then 0<=a(n)<=b. The positions of 0 in the sequence a are of interest, as are the position sequences for 1,2,...,b. These b+1 position sequences comprise a partition of the positive integers.
Examples:
(golden ratio,2,1): A190427-A190430
(sqrt(2),2,0): A190480-A190482
(sqrt(2),2,1): A190483-A190486
(sqrt(2),3,0): A190487-A190490
(sqrt(2),3,1): A190491-A190495
(sqrt(2),3,2): A190496-A190500
(sqrt(2),4,c): A190544-A190566

Links

Crossrefs

Cf. A190550, A190551, A190552, A190553.

Programs

  • Mathematica
    r = Sqrt[2]; b = 4; c = 1;
f[n_] := Floor[(b*n + c)*r] - b*Floor[n*r] - Floor[c*r];
t = Table[f[n], {n, 1, 200}] (* A190549 *)
Flatten[Position[t, 0]]          (* A190550 *)
Flatten[Position[t, 1]]          (* A190551 *)
Flatten[Position[t, 2]]          (* A190552 *)
Flatten[Position[t, 3]]          (* A190553 *)
Flatten[Position[t, 4]]          (* A190554 *)

A190561 a(n) = [(bn+c)r]-b[nr]-[cr], where (r,b,c)=(sqrt(2),4,3) and []=floor.

Original entry on oeis.org

1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 0, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 3, 1, 3, 0, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0
Offset: 1

Views

Author

Clark Kimberling, May 12 2011

Keywords

Comments

Write a(n)=[(bn+c)r]-b[nr]-[cr]. If r>0 and b and c are integers satisfying b>=2 and 0<=c<=b-1, then 0<=a(n)<=b. The positions of 0 in the sequence a are of interest, as are the position sequences for 1,2,...,b. These b+1 position sequences comprise a partition of the positive integers.
Examples:
(golden ratio,2,1): A190427-A190430
(sqrt(2),2,0): A190480-A190482
(sqrt(2),2,1): A190483-A190486
(sqrt(2),3,0): A190487-A190490
(sqrt(2),3,1): A190491-A190495
(sqrt(2),3,2): A190496-A190500
(sqrt(2),4,c): A190544-A190566

Links

Crossrefs

Cf. A190562 to A190566.

Programs

  • Mathematica
    r = Sqrt[2]; b = 4; c = 3;
f[n_] := Floor[(b*n + c)*r] - b*Floor[n*r] - Floor[c*r];
t = Table[f[n], {n, 1, 200}] (* A190561 *)
Flatten[Position[t, 0]]          (* A190562 *)
Flatten[Position[t, 1]]          (* A190563 *)
Flatten[Position[t, 2]]          (* A190564 *)
Flatten[Position[t, 3]]          (* A190565 *)
Flatten[Position[t, 4]]          (* A190566 *)

A190698 a(n) = [(bn+c)r]-b[nr]-[cr], where (r,b,c)=(sqrt(3),4,1) and [ ]=floor.

Original entry on oeis.org

3, 2, 1, 4, 3, 2, 1, 4, 3, 2, 0, 3, 2, 1, 4, 3, 2, 1, 4, 3, 2, 1, 4, 3, 1, 0, 3, 2, 1, 4, 3, 2, 1, 4, 3, 2, 1, 4, 2, 1, 0, 3, 2, 1, 4, 3, 2, 1, 4, 3, 2, 0, 3, 2, 1, 4, 3, 2, 1, 4, 3, 2, 1, 4, 3, 1, 0, 3, 2, 1, 4, 3, 2, 1, 4, 3, 2, 1, 4, 2, 1, 0, 3, 2, 1, 4, 3, 2, 1, 4, 3, 2, 1, 3, 2, 1, 0, 3, 2, 1, 4, 3, 2, 1, 4, 3, 2, 0, 3, 2, 1, 4, 3, 2, 1, 4, 3, 2, 1, 4, 3, 1, 0, 3, 2, 1, 4
Offset: 1

Views

Author

Clark Kimberling, May 17 2011

Keywords

Comments

Write a(n)=[(bn+c)r]-b[nr]-[cr]. If r>0 and b and c are integers satisfying b>=2 and 0<=c<=b-1, then 0<=a(n)<=b. The positions of 0 in the sequence a are of interest, as are the position sequences for 1,2,...,b. These b+1 position sequences comprise a partition of the positive integers.
Examples:
(golden ratio,2,1): A190427-A190430
(sqrt(2),2,0): A190480-A190482
(sqrt(2),2,1): A190483-A190486
(sqrt(2),3,0): A190487-A190490
(sqrt(2),3,1): A190491-A190495
(sqrt(2),3,2): A190496-A190500
(sqrt(2),4,c): A190544-A190566

Links

Crossrefs

Cf. A190699-A190703.

Programs

  • Mathematica
    r = Sqrt[3]; b = 4; c = 1;
f[n_] := Floor[(b*n + c)*r] - b*Floor[n*r] - Floor[c*r];
t = Table[f[n], {n, 1, 200}] (* A190698 *)
Flatten[Position[t, 0]]      (* A190699 *)
Flatten[Position[t, 1]]      (* A190700 *)
Flatten[Position[t, 2]]      (* A190701 *)
Flatten[Position[t, 3]]      (* A190702 *)
Flatten[Position[t, 4]]      (* A190703 *)
Showing 1-10 of 23 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.