Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119965
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A119965 The 3-almost primeth recurrence: a(0) = 1, a(n+1) = 3-almostprime(a(n)) = A014612(a(n)). +0
2
1, 8, 42, 174, 705, 2764, 10772, 41967, 164793, 654242, 2634801, 10787937, 44983894, 191249703, 829651874, 3673967785, 16612478231, 76708135651, 361707435767 (list; graph; listen)
OFFSET

0,2

COMMENT

3-almostprime equivalent of Wilson's primeth recurrence: A007097.

MATHEMATICA

ThreeAlmostPrimePi[n_] := Sum[PrimePi[n/(Prime@i*Prime@j)] - j + 1, {i, PrimePi[n^(1/3)]}, {j, i, PrimePi@Sqrt[n/Prime@i]}]; ThreeAlmostPrime[n_] := Block[{e = Floor[Log[2, n] + 1], a, b}, a = 2^e; Do[b = 2^p; While[ThreeAlmostPrimePi[a] < n, a = a + b]; a = a - b/2, {p, e, 0, -1}]; a + b/2]; NestList[ThreeAlmostPrime@# &, 1, 18]

CROSSREFS

Cf. A007097, A105999, A119966.

Sequence in context: A067301 A086392 A027903 this_sequence A055082 A093381 A097788

Adjacent sequences: A119962 A119963 A119964 this_sequence A119966 A119967 A119968

KEYWORD

nonn

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com) and Robert G. Wilson v (rgwv(AT)rgwv.com), May 31 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 5 23:38 EST 2009. Contains 170428 sequences.


AT&T Labs Research