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

A162906 a(n) = n - A081707(n).

Original entry on oeis.org

0, 1, 2, 3, 4, 4, 6, 7, 8, 8, 10, 9, 12, 12, 13, 15, 16, 15, 18, 17, 19, 20, 22, 20, 24, 24, 26, 25, 28, 25, 30, 31, 31, 32, 33, 31, 36, 36, 37, 36, 40, 37, 42, 41, 42, 44, 46, 43, 48, 47, 49, 49, 52, 50, 53, 52, 55, 56, 58, 52, 60, 60, 60, 63, 63, 61, 66, 65, 67, 65, 70, 65, 72, 72, 72
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Jul 17 2009

Keywords

Examples

			a(1)=1-1. a(2)=2-1. a(3)=3-1. a(4)=4-1. a(5)=5-1. a(6)=6-2.
		

Crossrefs

Programs

Formula

a(n) = A000027(n) - A081707(n) = n + A001222(n) - A000005(n).

Extensions

Duplicate of 9 removed by R. J. Mathar, Jul 21 2009

A303707 Number of factorizations of n using elements of A007916 (numbers that are not perfect powers).

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 2, 1, 1, 3, 1, 3, 2, 2, 1, 4, 1, 2, 1, 3, 1, 5, 1, 1, 2, 2, 2, 5, 1, 2, 2, 4, 1, 5, 1, 3, 3, 2, 1, 5, 1, 3, 2, 3, 1, 4, 2, 4, 2, 2, 1, 9, 1, 2, 3, 1, 2, 5, 1, 3, 2, 5, 1, 8, 1, 2, 3, 3, 2, 5, 1, 5, 1, 2, 1, 9, 2, 2, 2
Offset: 1

Views

Author

Gus Wiseman, Apr 29 2018

Keywords

Comments

First differs from A081707 at a(60) = 9, A081707(60) = 8.

Examples

			The a(60) = 9 factorizations are (2*2*3*5), (2*2*15), (2*3*10), (2*5*6), (2*30), (3*20), (5*12), (6*10), (60).
		

Crossrefs

Programs

  • Mathematica
    radQ[n_]:=Or[n===1,GCD@@FactorInteger[n][[All,2]]===1];
    facsr[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facsr[n/d],Min@@#>=d&]],{d,Select[Rest[Divisors[n]],radQ]}]];
    Table[Length[facsr[n]],{n,100}]

Formula

Dirichlet g.f.: Product_{n in A007916} 1/(1 - n^s).
Showing 1-2 of 2 results.