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

A302979 Powers of squarefree numbers whose prime indices are relatively prime. Heinz numbers of uniform partitions with relatively prime parts.

Original entry on oeis.org

2, 4, 6, 8, 10, 14, 15, 16, 22, 26, 30, 32, 33, 34, 35, 36, 38, 42, 46, 51, 55, 58, 62, 64, 66, 69, 70, 74, 77, 78, 82, 85, 86, 93, 94, 95, 100, 102, 105, 106, 110, 114, 118, 119, 122, 123, 128, 130, 134, 138, 141, 142, 143, 145, 146, 154, 155, 158, 161, 165
Offset: 1

Views

Author

Gus Wiseman, Apr 16 2018

Keywords

Comments

A prime index of n is a number m such that prime(m) divides n. An integer partition is uniform if all parts appear with the same multiplicity. The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).
The number of uniform partitions of n with relatively prime parts is A078374(n).

Examples

			Sequence of all uniform relatively prime integer partitions begins (1), (11), (21), (111), (31), (41), (32), (1111), (51), (61), (321), (11111), (52), (71), (43), (2211).
		

Crossrefs

Programs

  • Mathematica
    Select[Range[200],And[GCD@@PrimePi/@FactorInteger[#][[All,1]]===1,SameQ@@FactorInteger[#][[All,2]]]&]

A292127 a(1) = 1, a(r(n)^k) = 1 + k * a(n) where r(n) is the n-th number that is not a perfect power A007916(n).

Original entry on oeis.org

1, 2, 3, 3, 4, 4, 5, 4, 5, 5, 6, 5, 6, 6, 7, 5, 6, 7, 7, 8, 6, 7, 8, 8, 7, 9, 7, 7, 8, 9, 9, 6, 8, 10, 8, 7, 8, 9, 10, 10, 7, 9, 11, 9, 8, 9, 10, 11, 9, 11, 8, 10, 12, 10, 9, 10, 11, 12, 10, 12, 9, 11, 13, 7, 11, 10, 11, 12, 13, 11, 13, 10, 12, 14, 8, 12, 11
Offset: 1

Views

Author

Gus Wiseman, Sep 09 2017

Keywords

Comments

Any positive integer greater than 1 can be written uniquely as a perfect power r(n)^k. We define a planted achiral (or generalized Bethe) tree b(n) for any positive integer greater than 1 by writing n as a perfect power r(d)^k and forming a tree with k branches all equal to b(d). Then a(n) is the number of nodes in b(n).

Examples

			The first nineteen planted achiral trees are:
o,
(o),
((o)), (oo),
(((o))), ((oo)),
((((o)))), (ooo), ((o)(o)), (((oo))),
(((((o))))), ((ooo)), (((o)(o))), ((((oo)))),
((((((o)))))), (oooo), (((ooo))), ((((o)(o)))), (((((oo))))).
		

Crossrefs

Programs

  • Mathematica
    nn=100;
    rads=Select[Range[2,nn],GCD@@FactorInteger[#][[All,2]]===1&];
    a[1]:=1;a[n_]:=With[{k=GCD@@FactorInteger[n][[All,2]]},1+k*a[Position[rads,n^(1/k)][[1,1]]]];
    Array[a,nn]
Previous Showing 11-12 of 12 results.