login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A171919 Number of solutions to n=x*y*z, x+y-z=1 with ordered triples (x,y,z), x,y,z>=1. 3
1, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

Record values start a(1)=1, a(4)=2, a(112)=3, a(144)=6, a(23400)=8, a(28224)=10.

If n is a perfect square, a(n)>0.

Larger record indices are listed in A181485, and associated values in A181486. - M. F. Hasler, Oct 23 2010

First occurrence of k: 2, 1, 4, 112, 480, 43120, 144, 218880, 23400, ??, 28224, ??, 373464, ??, 247104, ??, 604800, ??, 83010312, ??, 26812800, ..., . - Robert G. Wilson v, Oct 30 2010

a(388778796252000) = 38.

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..28224

EXAMPLE

For n=4, the a(4)=2 solutions are (x,y,z)=(1,2,2) and (2,1,2).

For n=12, the a(12)=1 solution is (x,y,z)=(2,2,3).

MAPLE

A := proc(n) local a, dvs, x, y, z, dvsyz; a :=0 ; dvs := numtheory[divisors](n) ; for x in dvs do yz := n/x ; dvsyz := numtheory[divisors](yz) ; for y in dvsyz do z := yz/y ; if x+y-z=1 then a := a+1 ; fi; end do; end do:

return a; end proc: seq(A(n), n=1..100) ; # R. J. Mathar, Oct 23 2010

MATHEMATICA

f[n_] := Block[{c = 0, cong = {0, 1, 4, 9, 12, 16, 21, 24, 25, 36, 37, 40, 45, 49, 52, 57}, dvs = Divisors@ n, dvt, j = 1, k, lmt1, lmt2}, If[ MemberQ[ cong, Mod[n, 60]], lmtj = Length@ dvs + 1; While[j < lmtj, dvt = Divisors[ n/dvs[[j]]]; k = 1; lmtk = Length@ dvt + 1; While[k < lmtk, If[ dvs[[j]] + dvt[[k]] == n/(dvs[[j]]*dvt[[k]]) + 1, c++ ]; k++ ]; j++ ]]; c]; Array[f, 105] (* Robert G. Wilson v, Oct 24 2010 *)

PROG

(PARI) A171919(n)={ my(c=0, t); fordiv(n, z, fordiv( t=n/z, y, y>z & break; y*(z+1-y)==t & c++) ); c} /* can be improved by restricting to x<=y and counting twice if x<y */ \\ M. F. Hasler, Oct 23 2010

CROSSREFS

Cf. A181485, A181486.

Sequence in context: A234859 A001343 A022882 * A000089 A339430 A350386

Adjacent sequences: A171916 A171917 A171918 * A171920 A171921 A171922

KEYWORD

nonn

AUTHOR

Georgi Guninski, Oct 23 2010

EXTENSIONS

Some more values from M. F. Hasler, Oct 23 2010

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 15:01 EST 2022. Contains 358667 sequences. (Running on oeis4.)