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!)
A190267 Numbers n such that d(n-1) = d(n+1) = 6, where d(k) is the number of divisors of k (A000005). 2
19, 51, 243, 244, 424, 476, 604, 638, 723, 846, 926, 1683, 1774, 2008, 2524, 2526, 2528, 3124, 3176, 3178, 4204, 4476, 4526, 4924, 5824, 6726, 6812, 6963, 7300, 7443, 7676, 8426, 8958, 8974, 9458, 9926, 10052, 10083, 10468, 11674, 11710, 12428, 12483, 12592 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Nathaniel Johnston, Table of n, a(n) for n = 1..2500

MAPLE

with(numtheory): A190267 := proc(n) option remember: local k: if(n=1)then return 19:else k:=procname(n-1)+1: do if(tau(k-1)=6 and tau(k+1)=6)then return k: fi: k:=k+1: od: fi: end: seq(A190267(n), n=1..44); # Nathaniel Johnston, May 06 2011

CROSSREFS

Cf. A030515, A189974.

Sequence in context: A156376 A063306 A267572 * A066775 A118591 A031341

Adjacent sequences:  A190264 A190265 A190266 * A190268 A190269 A190270

KEYWORD

nonn

AUTHOR

Juri-Stepan Gerasimov, May 06 2011

STATUS

approved

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 April 8 00:29 EDT 2020. Contains 333311 sequences. (Running on oeis4.)