login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A177268 a(n) = the smallest positive integer not yet occurring such that the number of divisors of 1+sum{k=1 to n} a(k) is exactly n. 1

%I

%S 1,2,4,8,12,36,6,30,62,862,11,3061,4096,8192,17,49135,60,196548,48,

%T 977,6143,3924992,21,283131,15856,5329,111,263936704,1744,805304624,

%U 10,14730230,670720,18082841,50,67612251061,786432,99913728,80

%N a(n) = the smallest positive integer not yet occurring such that the number of divisors of 1+sum{k=1 to n} a(k) is exactly n.

%C It seems possible that this is a permutation of the positive integers. Is it?

%C This is analogous to A175350(n) with a(1)=a(2)=1.

%C 1 + sum{k=1 to n} a(k) = A177269(n).

%Y Cf. A175350, A177269

%K nonn

%O 2,2

%A _Hugo van der Sanden_, May 06 2010

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 5 05:22 EDT 2020. Contains 336209 sequences. (Running on oeis4.)