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-3 of 3 results.

A191323 Increasing sequence generated by these rules: a(1)=1, and if x is in a then [3x/2]+1 and 3x+1 are in a, where [ ]=floor.

Original entry on oeis.org

1, 2, 4, 7, 11, 13, 17, 20, 22, 26, 31, 34, 40, 47, 52, 61, 67, 71, 79, 92, 94, 101, 103, 107, 119, 121, 139, 142, 152, 155, 157, 161, 179, 182, 184, 202, 209, 214, 229, 233, 236, 238, 242, 269, 274, 277, 283, 304, 310, 314, 322, 344, 350, 355, 358, 364, 404, 412, 416, 418, 425, 427, 457, 466, 472, 484, 517, 526, 533, 538, 547, 553
Offset: 1

Views

Author

Clark Kimberling, May 30 2011

Keywords

Comments

This sequence represents a class of sequences generated by rules of the form "a(1)=1, and if x is in a then floor(hx+i) and floor(jx+k) are in a, where h and j are rational numbers and i and k are positive integers." In the following examples, the floor function is denoted by [ ].
A191323: [3x/2]+1, 3x+1
A191324: [3x/2]+1, 3x+2
A191325: [3x/2], [5x/2]
A191326: [3x/2], [7x/2]
A191327: [5x/2], [7x/2]
A191328: [5x/3], [7x/3]
Other families of sequences generated by "rules" are listed at A191803, A191106, A101113 and A191203.

Examples

			1 -> 2,4 -> 6,7,13 -> 10,11,19,20,22,40 -> ...

Links

Crossrefs

Cf. A190503, A191100, A191113, A191203.

Programs

  • Mathematica
    h = 3; i = 1; j = 3; k = 1; f = 1; g = 12;
a=Union[Flatten[NestList[{Floor[h#/2]+i,j#+k}&,f,g]]]
(* A191323 *)

A190846 (Squarefree part of (ABC))/C for A=1, C=A+B, as a function of B, rounded to the nearest integer.

Original entry on oeis.org

1, 2, 2, 2, 5, 6, 2, 1, 3, 10, 6, 6, 13, 14, 2, 2, 6, 6, 10, 10, 21, 22, 6, 1, 5, 3, 2, 14, 29, 30, 2, 2, 33, 34, 6, 6, 37, 38, 10, 10, 41, 42, 22, 7, 15, 46, 6, 1, 1, 10, 26, 26, 6, 6, 14, 14, 57, 58, 30, 30, 61, 21, 1, 2, 65, 66, 34, 34, 69, 70, 6, 6, 73, 15, 8, 38, 77, 78, 10, 0, 3, 82, 42
Offset: 1

Views

Author

Darrell Minor, May 25 2011

Keywords

Comments

Given A, B natural numbers, and C=A+B, the ABC conjecture deals with the ratio of the squarefree part of the product A*B*C, divided by C. Here, B plays the role of the OEIS index n.

Examples

			For B=14, we have C=15, so SQP(ABC)=SQP(210)=2*3*5*7=210, so SQP(ABC)/C=210/15=14.
For B=19, we have C=20, so SQP(ABC)=SQP(380)=2*5*19=190, so SQP(ABC)/C=190/20=9.5, which rounds to 10.

Links

Crossrefs

Cf. A191093, A191100, A120498.

Programs

  • Magma
    SQP:=func< n | &*[ f[j, 1]: j in [1..#f] ] where f is Factorization(n) >; A190846:=func< n | Round(SQP(a*n*c)/c) where c is a+n where a is 1 >; [ A190846(n): n in [1..85] ]; // Klaus Brockhaus, May 27 2011
  • Maple
    A190846 := proc(n) c := 1+n ; round(A007947(n*c)/c) ; end proc:
seq(A190846(n),n=1..80) ; # R. J. Mathar, Jun 10 2011
  • Mathematica
    Array[Round[SelectFirst[Reverse@ Divisors[#1 #2], SquareFreeQ]/#2] & @@ {#, # + 1} &, 83] (* Michael De Vlieger, Feb 19 2019 *)
  • PARI
    rad(n)=my(f=factor(n)[,1]); prod(i=1,#f,f[i])
a(n)=rad(n^2+n)\/(n+1) \\ Charles R Greathouse IV, Mar 11 2014
  • Python
    from operator import mul
from sympy import primefactors
def rad(n): return 1 if n<2 else reduce(mul, primefactors(n))
def a(n): return int(round(rad(n**2 + n)/(n + 1))) # Indranil Ghosh, May 24 2017

A191093 [Squarefree part of (ABC)]/C for A=2, C=A+B, as a function of B, rounded to nearest integer.

Original entry on oeis.org

2, 1, 6, 1, 10, 1, 5, 1, 6, 3, 22, 3, 26, 1, 30, 0, 34, 2, 38, 5, 42, 3, 9, 3, 1, 7, 6, 7, 58, 1, 62, 1, 66, 3, 70, 3, 74, 5, 78, 5, 82, 11, 29, 11, 30, 3, 13, 1, 14, 3, 102, 1, 106, 1, 110, 7, 114, 15, 118, 15, 41, 1, 42, 1, 130, 17, 134, 17, 138, 3, 142, 3, 29, 19, 30, 19, 154
Offset: 1

Views

Author

Darrell Minor, May 25 2011

Keywords

Examples

			For B=10, we have C=12 so SQP(ABC)=SQP(240)=2*3*5=30, so SQP(ABC)/C=30/12=2.5, which rounds off to 3.
For B=16, we have C=18 so SQP(ABC)=SQP(576)=2*3=6, so SQP(ABC)/C=6/18=0.33, which rounds off to 0.

Links

Crossrefs

Cf. A190846, A191100, A120498.

Programs

  • Magma
    SQP:=func< n | &*[ f[j, 1]: j in [1..#f] ] where f is Factorization(n) >; A191093:=func< n | Round(SQP(a*n*c)/c) where c is a+n where a is 2 >; [ A191093(n): n in [1..80] ]; // Klaus Brockhaus, May 27 2011
  • PARI
    rad(n)=my(f=factor(n)[,1]); prod(i=1,#f,f[i])
a(n)=rad(2*n^2+4*n)\/(n+2) \\ Charles R Greathouse IV, Mar 11 2014
  • Python
    from operator import mul
from sympy import primefactors
def rad(n): return 1 if n<2 else reduce(mul, primefactors(n))
def a(n): return int(round(rad(2*n**2 + 4*n)/(n + 2))) # Indranil Ghosh, May 24 2017
Showing 1-3 of 3 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.